| Multidimensional knapsack problems H Kellerer, U Pferschy, D Pisinger Knapsack problems, 235-283, 2004 | 3607 | 2004 |
| 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), 427-449, 2006 | 257 | 2006 |
| 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 | 203 | 2000 |
| The multidimensional knapsack problem: Structure and algorithms J Puchinger, GR Raidl, U Pferschy INFORMS Journal on Computing 22 (2), 250-265, 2010 | 187 | 2010 |
| Introduction to NP-Completeness of knapsack problems H Kellerer, U Pferschy, D Pisinger Knapsack problems, 483-493, 2004 | 172 | 2004 |
| Approximating multiobjective knapsack problems T Erlebach, H Kellerer, U Pferschy Management Science 48 (12), 1603-1612, 2002 | 113 | 2002 |
| The core concept for the multidimensional knapsack problem J Puchinger, GR Raidl, U Pferschy European conference on evolutionary computation in combinatorial …, 2006 | 107 | 2006 |
| The Knapsack Problem with Conflict Graphs. U Pferschy, J Schauer J. Graph Algorithms Appl. 13 (2), 233-249, 2009 | 104 | 2009 |
| A new fully polynomial time approximation scheme for the knapsack problem H Kellerer, U Pferschy Journal of Combinatorial Optimization 3 (1), 59-71, 1999 | 101 | 1999 |
| The multiple subset sum problem A Caprara, H Kellerer, U Pferschy SIAM Journal on Optimization 11 (2), 308-319, 2000 | 94 | 2000 |
| 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 | 91 | 2004 |
| 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 | 85 | 2004 |
| Paths, trees and matchings under disjunctive constraints A Darmann, U Pferschy, J Schauer, GJ Woeginger Discrete Applied Mathematics 159 (16), 1726-1735, 2011 | 82 | 2011 |
| 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 | 78 | 2003 |
| Approximation schemes for ordered vector packing problems A Caprara, H Kellerer, U Pferschy Naval Research Logistics (NRL) 50 (1), 58-69, 2003 | 56 | 2003 |
| Inverse 1-center location problems with edge length augmentation on trees B Alizadeh, RE Burkard, U Pferschy Computing 86 (4), 331, 2009 | 53 | 2009 |
| Exact solution of the robust knapsack problem M Monaci, U Pferschy, P Serafini Computers & operations research 40 (11), 2625-2631, 2013 | 52 | 2013 |
| 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 | 51 | 2000 |
| Cardinality constrained bin‐packing problems H Kellerer, U Pferschy Annals of Operations Research 92, 335-348, 1999 | 51 | 1999 |
| Dynamic programming revisited: Improving knapsack algorithms U Pferschy Computing 63 (4), 419-430, 1999 | 50 | 1999 |
