Ulrich Pferschy
Ulrich Pferschy
Verified email at uni-graz.at
TitleCited byYear
Multidimensional knapsack problems
H Kellerer, U Pferschy, D Pisinger
Knapsack problems, 235-283, 2004
31992004
An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
I Ljubić, R Weiskircher, U Pferschy, GW Klau, P Mutzel, M Fischetti
Mathematical programming 105 (2-3), 427-449, 2006
2242006
Approximation algorithms for knapsack problems with cardinality constraints
A Caprara, H Kellerer, U Pferschy, D Pisinger
European Journal of Operational Research 123 (2), 333-345, 2000
1782000
The multidimensional knapsack problem: Structure and algorithms
J Puchinger, GR Raidl, U Pferschy
INFORMS Journal on Computing 22 (2), 250-265, 2010
1642010
Approximating multiobjective knapsack problems
T Erlebach, H Kellerer, U Pferschy
Management Science 48 (12), 1603-1612, 2002
1082002
The core concept for the multidimensional knapsack problem
J Puchinger, GR Raidl, U Pferschy
European Conference on Evolutionary Computation in Combinatorial …, 2006
952006
A new fully polynomial time approximation scheme for the knapsack problem
H Kellerer, U Pferschy
Journal of Combinatorial Optimization 3 (1), 59-71, 1999
921999
The multiple subset sum problem
A Caprara, H Kellerer, U Pferschy
SIAM Journal on Optimization 11 (2), 308-319, 2000
882000
An efficient fully polynomial approximation scheme for the subset-sum problem
H Kellerer, R Mansini, U Pferschy, MG Speranza
Journal of Computer and System Sciences 66 (2), 349-370, 2003
872003
Improved dynamic programming in connection with an FPTAS for the knapsack problem
H Kellerer, U Pferschy
Journal of Combinatorial Optimization 8 (1), 5-11, 2004
812004
The Knapsack Problem with Conflict Graphs.
U Pferschy, J Schauer
J. Graph Algorithms Appl. 13 (2), 233-249, 2009
772009
Combining a memetic algorithm with integer programming to solve the prize-collecting Steiner tree problem
GW Klau, I Ljubić, A Moser, P Mutzel, P Neuner, U Pferschy, G Raidl, ...
Genetic and Evolutionary Computation Conference, 1304-1315, 2004
722004
Paths, trees and matchings under disjunctive constraints
A Darmann, U Pferschy, J Schauer, GJ Woeginger
Discrete Applied Mathematics 159 (16), 1726-1735, 2011
642011
A PTAS for the multiple subset sum problem with different knapsack capacities
A Caprara, H Kellerer, U Pferschy
Information Processing Letters 73 (3-4), 111-118, 2000
492000
Cardinality constrained bin‐packing problems
H Kellerer, U Pferschy
Annals of Operations Research 92, 335-348, 1999
491999
Approximation schemes for ordered vector packing problems
A Caprara, H Kellerer, U Pferschy
Naval Research Logistics (NRL) 50 (1), 58-69, 2003
482003
Dynamic programming revisited: Improving knapsack algorithms
U Pferschy
Computing 63 (4), 419-430, 1999
471999
Worst-case analysis of the subset sum algorithm for bin packing
A Caprara, U Pferschy
Operations Research Letters 32 (2), 159-166, 2004
462004
Exact solution of the robust knapsack problem
M Monaci, U Pferschy, P Serafini
Computers & operations research 40 (11), 2625-2631, 2013
432013
Solving the prize-collecting Steiner tree problem to optimality
I Ljubic, R Weiskircher, U Pferschy, GW Klau, P Mutzel, M Fischetti
ALENEX/ANALCO, 68-76, 2005
432005
The system can't perform the operation now. Try again later.
Articles 1–20