Folgen
Ulrich Pferschy
Ulrich Pferschy
Bestätigte E-Mail-Adresse bei uni-graz.at
Titel
Zitiert von
Zitiert von
Jahr
Multidimensional knapsack problems
H Kellerer, U Pferschy, D Pisinger, H Kellerer, U Pferschy, D Pisinger
Knapsack problems, 235-283, 2004
40712004
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, 427-449, 2006
2792006
The multidimensional knapsack problem: Structure and algorithms
J Puchinger, GR Raidl, U Pferschy
INFORMS Journal on Computing 22 (2), 250-265, 2010
2312010
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
2212000
Introduction to NP-Completeness of knapsack problems
H Kellerer, U Pferschy, D Pisinger, H Kellerer, U Pferschy, D Pisinger
Knapsack problems, 483-493, 2004
2022004
The Knapsack Problem with Conflict Graphs.
U Pferschy, J Schauer
J. Graph Algorithms Appl. 13 (2), 233-249, 2009
1292009
Approximating multiobjective knapsack problems
T Erlebach, H Kellerer, U Pferschy
Management Science 48 (12), 1603-1612, 2002
1292002
The core concept for the multidimensional knapsack problem
J Puchinger, GR Raidl, U Pferschy
Evolutionary Computation in Combinatorial Optimization: 6th European …, 2006
1112006
The multiple subset sum problem
A Caprara, H Kellerer, U Pferschy
SIAM Journal on Optimization 11 (2), 308-319, 2000
1082000
A new fully polynomial time approximation scheme for the knapsack problem
H Kellerer, U Pferschy
Journal of Combinatorial Optimization 3 (1), 59-71, 1999
1061999
Paths, trees and matchings under disjunctive constraints
A Darmann, U Pferschy, J Schauer, GJ Woeginger
Discrete Applied Mathematics 159 (16), 1726-1735, 2011
1012011
Improved dynamic programming in connection with an FPTAS for the knapsack problem
H Kellerer, U Pferschy
Journal of Combinatorial Optimization 8, 5-11, 2004
1012004
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–GECCO 2004: Genetic and Evolutionary …, 2004
912004
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
852003
Exact solution of the robust knapsack problem
M Monaci, U Pferschy, P Serafini
Computers & operations research 40 (11), 2625-2631, 2013
682013
Generating subtour elimination constraints for the TSP from pure integer solutions
U Pferschy, R Staněk
Central European journal of operations research 25, 231-260, 2017
662017
Approximation schemes for ordered vector packing problems
A Caprara, H Kellerer, U Pferschy
Naval Research Logistics (NRL) 50 (1), 58-69, 2003
642003
Dynamic Programming Revisited: Improving Knapsack Algorithms.
U Pferschy
Computing 63 (4), 1999
631999
Inverse 1-center location problems with edge length augmentation on trees
B Alizadeh, RE Burkard, U Pferschy
Computing 86 (4), 331-343, 2009
582009
Cardinality constrained bin‐packing problems
H Kellerer, U Pferschy
Annals of Operations Research 92 (0), 335-348, 1999
581999
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20