Knapsack problems. Zbl 1103.90003
Kellerer, Hans; Pferschy, Ulrich; Pisinger, David |
|
2004
|
An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Zbl 1085.90061
Ljubić, Ivana; Weiskircher, René; Pferschy, Ulrich; Klau, Gunnar W.; Mutzel, Petra; Fischetti, Matteo |
|
2006
|
The knapsack problem with conflict graphs. Zbl 1194.68175
Pferschy, Ulrich; Schauer, Joachim |
|
2009
|
Approximation algorithms for knapsack problems with cardinality constraints. Zbl 0961.90131
Caprara, Alberto; Kellerer, Hans; Pferschy, Ulrich; Pisinger, David |
|
2000
|
Inverse 1-center location problems with edge length augmentation on trees. Zbl 1180.90163
Alizadeh, Behrooz; Burkard, Rainer E.; Pferschy, Ulrich |
|
2009
|
Paths, trees and matchings under disjunctive constraints. Zbl 1228.05186
Darmann, Andreas; Pferschy, Ulrich; Schauer, Joachim; Woeginger, Gerhard J. |
|
2011
|
The multidimensional knapsack problem: structure and algorithms. Zbl 1243.90190
Puchinger, Jakob; Raidl, Günther R.; Pferschy, Ulrich |
|
2010
|
Approximating multiobjective knapsack problems. Zbl 1232.90324
Erlebach, Thomas; Kellerer, Hans; Pferschy, Ulrich |
|
2002
|
A new fully polynomial time approximation scheme for the Knapsack problem. Zbl 0957.90112
Kellerer, Hans; Pferschy, Ulrich |
|
1999
|
Improved dynamic programming in connection with an FPTAS for the knapsack problem. Zbl 1058.90070
Kellerer, Hans; Pferschy, Ulrich |
|
2004
|
Exact solution of the robust knapsack problem. Zbl 1348.90549
Monaci, Michele; Pferschy, Ulrich; Serafini, Paolo |
|
2013
|
The maximum flow problem with disjunctive constraints. Zbl 1275.90120
Pferschy, Ulrich; Schauer, Joachim |
|
2013
|
An efficient fully polynomial approximation scheme for the Subset-Sum problem. Zbl 1045.68157
Kellerer, Hans; Mansini, Renata; Pferschy, Ulrich; Speranza, Maria Grazia |
|
2003
|
Approximation schemes for ordered vector packing problems. Zbl 1045.90055
Caprara, Alberto; Kellerer, Hans; Pferschy, Ulrich |
|
2003
|
Cardinality constrained bin-packing problems. Zbl 0955.90106
Kellerer, Hans; Pferschy, Ulrich |
|
1999
|
Determining a minimum spanning tree with disjunctive constraints. Zbl 1260.68171
Darmann, Andreas; Pferschy, Ulrich; Schauer, Joachim |
|
2009
|
Approximation of knapsack problems with conflict and forcing graphs. Zbl 1376.90052
Pferschy, Ulrich; Schauer, Joachim |
|
2017
|
The multiple subset sum problem. Zbl 1010.90070
Caprara, Alberto; Kellerer, Hans; Pferschy, Ulrich |
|
2000
|
Worst-case analysis of the subset sum algorithm for bin packing. Zbl 1060.90061
Caprara, Alberto; Pferschy, Ulrich |
|
2004
|
A PTAS for the multiple subset sum problem with different knapsack capacities. Zbl 1014.68225
Caprara, Alberto; Kellerer, Hans; Pferschy, Ulrich |
|
2000
|
Price of fairness for allocating a bounded resource. Zbl 1394.91252
Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich |
|
2017
|
Resource allocation with time intervals. Zbl 1208.90058
Darmann, Andreas; Pferschy, Ulrich; Schauer, Joachim |
|
2010
|
The core concept for the Multidimensional Knapsack problem. Zbl 1401.90198
Puchinger, Jakob; Raidl, Günther R.; Pferschy, Ulrich |
|
2006
|
On the robust knapsack problem. Zbl 1306.90134
Monaci, Michele; Pferschy, Ulrich |
|
2013
|
Dynamic programming revisited: Improving knapsack algorithms. Zbl 0946.90053
Pferschy, U. |
|
1999
|
A 3/4-approximation algorithm for multiple subset sum. Zbl 1035.90068
Caprara, Alberto; Kellerer, Hans; Pferschy, Ulrich |
|
2003
|
Improved dynamic programming and approximation results for the knapsack problem with setups. Zbl 1391.90531
Pferschy, Ulrich; Scatamacchia, Rosario |
|
2018
|
The fractional prize-collecting Steiner tree problem on trees (extended abstract). Zbl 1266.90188
Klau, Gunnar W.; Ljubić, Ivana; Mutzel, Petra; Pferschy, Ulrich; Weiskircher, René |
|
2003
|
Solution methods and computational investigations for the linear bottleneck assignment problem. Zbl 0894.90127
Pferschy, U. |
|
1997
|
The maximum flow problem with conflict and forcing conditions. Zbl 1345.05040
Pferschy, Ulrich; Schauer, Joachim |
|
2011
|
The Subset Sum game. Zbl 1339.91069
Darmann, Andreas; Nicosia, Gaia; Pferschy, Ulrich; Schauer, Joachim |
|
2014
|
Approximation of the quadratic knapsack problem. Zbl 1343.90080
Pferschy, Ulrich; Schauer, Joachim |
|
2016
|
A Stackelberg knapsack game with weight control. Zbl 1443.91085
Pferschy, Ulrich; Nicosia, Gaia; Pacifici, Andrea |
|
2019
|
Integer optimization with penalized fractional values: the knapsack case. Zbl 1403.90579
Malaguti, Enrico; Monaci, Michele; Paronuzzi, Paolo; Pferschy, Ulrich |
|
2019
|
Simple but efficient approaches for the collapsing knapsack problem. Zbl 0881.90098
Pferschy, Ulrich; Pisinger, David; Woeginger, Gerhard J. |
|
1997
|
Approximating multi-objective knapsack problems. Zbl 1018.90034
Erlebach, Thomas; Kellerer, Hans; Pferschy, Ulrich |
|
2001
|
Generating subtour elimination constraints for the TSP from pure integer solutions. Zbl 1364.90296
Pferschy, Ulrich; Staněk, Rostislav |
|
2017
|
New exact approaches and approximation results for the penalized knapsack problem. Zbl 1411.90292
Della Croce, Federico; Pferschy, Ulrich; Scatamacchia, Rosario |
|
2019
|
Strategies in competing subset selection. Zbl 1272.91017
Marini, Claudia; Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich |
|
2013
|
Competitive subset selection with two agents. Zbl 1227.90042
Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich |
|
2011
|
A multi-commodity flow approach for the design of the last mile in real-world fiber optic networks. Zbl 1209.90365
Wagner, Daniel; Raidl, Günther; Pferschy, Ulrich; Mutzel, Petra; Bachhiesl, Peter |
|
2007
|
Approximation results for the incremental knapsack problem. Zbl 1504.90117
Della Croce, Federico; Pferschy, Ulrich; Scatamacchia, Rosario |
|
2018
|
Modified subset sum heuristics for bin packing. Zbl 1184.68661
Caprara, Alberto; Pferschy, Ulrich |
|
2005
|
Minimization and maximization versions of the quadratic travelling salesman problem. Zbl 1375.90265
Oswin, Aichholzer; Fischer, Anja; Fischer, Frank; Meier, J. Fabian; Pferschy, Ulrich; Pilz, Alexander; Staněk, Rostislav |
|
2017
|
Maximizing the minimum voter satisfaction on spanning trees. Zbl 1177.91068
Darmann, Andreas; Klamler, Christian; Pferschy, Ulrich |
|
2009
|
The traveling group problem. Zbl 1180.91110
Klamler, Christian; Pferschy, Ulrich |
|
2007
|
The random linear bottleneck assignment problem. Zbl 0868.90083
Pferschy, U. |
|
1996
|
The shortest path game: complexity and algorithms. Zbl 1417.68065
Darmann, Andreas; Pferschy, Ulrich; Schauer, Joachim |
|
2014
|
Geometric and LP-based heuristics for angular travelling salesman problems in the plane. Zbl 1458.90561
Staněk, Rostislav; Greistorfer, Peter; Ladner, Klaus; Pferschy, Ulrich |
|
2019
|
Monge matrices make maximization manageable. Zbl 0822.90112
Pferschy, Ulrich; Rudolf, Rüdiger; Woeginger, Gerhard J. |
|
1994
|
A new fully polynomial approximation scheme for the knapsack problem. Zbl 0908.90190
Kellerer, Hans; Pferschy, Ulrich |
|
1998
|
Scheduling two agent task chains with a central selection mechanism. Zbl 1320.90020
Agnetis, Alessandro; Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich |
|
2015
|
Two agents competing for a shared machine. Zbl 1404.90071
Agnetis, Alessandro; Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich |
|
2013
|
On the Stackelberg knapsack game. Zbl 1487.90565
Pferschy, Ulrich; Nicosia, Gaia; Pacifici, Andrea; Schauer, Joachim |
|
2021
|
A note on maximizing the minimum voter satisfaction on spanning trees. Zbl 1232.91174
Darmann, Andreas; Klamler, Christian; Pferschy, Ulrich |
|
2010
|
An efficient approximation scheme for the subset-sum problem. Zbl 0888.90123
Kellerer, Hans; Pferschy, Ulrich; Speranza, Maria Grazia |
|
1997
|
The inverse-parametric knapsack problem. Zbl 0904.90121
Burkard, Rainer E.; Pferschy, Ulrich |
|
1995
|
Approximating the 3-period incremental knapsack problem. Zbl 1416.90041
Della Croce, Federico; Pferschy, Ulrich; Scatamacchia, Rosario |
|
2018
|
Approximating the quadratic knapsack problem on special graph classes. Zbl 1417.68163
Pferschy, Ulrich; Schauer, Joachim |
|
2014
|
Approximating the product knapsack problem. Zbl 1477.90089
Pferschy, Ulrich; Schauer, Joachim; Thielen, Clemens |
|
2021
|
On approximating the incremental knapsack problem. Zbl 1423.90218
Della Croce, Federico; Pferschy, Ulrich; Scatamacchia, Rosario |
|
2019
|
Finding socially best spanning treesî. Zbl 1209.91067
Darmann, Andreas; Klamler, Christian; Pferschy, Ulrich |
|
2011
|
On the shortest path game. Zbl 1351.05152
Darmann, Andreas; Pferschy, Ulrich; Schauer, Joachim |
|
2017
|
Committee selection with a weight constraint based on lexicographic rankings of individuals. Zbl 1260.91087
Klamler, Christian; Pferschy, Ulrich; Ruzika, Stefan |
|
2009
|
Subset weight maximization with two competing agents. Zbl 1260.91110
Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich |
|
2009
|
Greedy algorithms for on-line data compression. Zbl 0895.68062
Békési, József; Galambos, Gábor; Pferschy, Ulrich; Woeginger, Gerhard J. |
|
1997
|
Fair packing of independent sets. Zbl 07601005
Chiarelli, Nina; Krnc, Matjaž; Milanič, Martin; Pferschy, Ulrich; Pivač, Nevena; Schauer, Joachim |
|
2020
|
Two agent scheduling with a central selection mechanism. Zbl 1329.90067
Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich |
|
2015
|
ILP models for a nurse scheduling problem. Zbl 1209.90217
Klinz, Bettina; Pferschy, Ulrich; Schauer, Joachim |
|
2007
|
Allocating indivisible items with minimum dissatisfaction on preference graphs. Zbl 07670910
Chiarelli, Nina; Dallard, Clément; Darmann, Andreas; Lendl, Stefan; Milanič, Martin; Muršič, Peter; Pivač, Nevena; Pferschy, Ulrich |
|
2021
|
Fair allocation of indivisible items with conflict graphs. Zbl 07680781
Chiarelli, Nina; Krnc, Matjaž; Milanič, Martin; Pferschy, Ulrich; Pivač, Nevena; Schauer, Joachim |
|
2023
|
The fractional greedy algorithm for data compression. Zbl 0842.94007
Békési, J.; Galambos, G.; Pferschy, U.; Woeginger, G. J. |
|
1996
|
On three topics in combinatorial optimization. Zbl 0864.90107
Pferschy, Ulrich |
|
1995
|
Linear programs with an additional rank two reverse convex constraint. Zbl 0802.90084
Pferschy, Ulrich; Tuy, Hoang |
|
1994
|
Partitioning graphs into two trees. Zbl 0820.68089
Pferschy, Ulrich; Woeginger, Gerhard J.; Yao, En-Yu |
|
1994
|
Approximation schemes for ordered vector packing problems. Zbl 1010.90063
Caprara, Alberto; Kellerer, Hans; Pferschy, Ulrich |
|
2001
|
Optimally rescheduling jobs with a last-in-first-out buffer. Zbl 1480.90137
Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich; Resch, Julia; Righini, Giovanni |
|
2021
|
Committee selection under weight constraints. Zbl 1247.91052
Klamler, Christian; Pferschy, Ulrich; Ruzika, Stefan |
|
2012
|
Stochastic analysis of greedy algorithms for the subset sum problem. Zbl 0941.90064
Pferschy, Ulrich |
|
1999
|
Maximin fairness in project budget allocation. Zbl 1358.91072
Naldi, Maurizio; Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich |
|
2016
|
Linear models and computational experiments for the quadratic TSP. Zbl 1364.90289
Fischer, Anja; Meier, J. Fabian; Pferschy, Ulrich; Staněk, Rostislav |
|
2016
|
Fair allocation of indivisible items with conflict graphs. Zbl 07680781
Chiarelli, Nina; Krnc, Matjaž; Milanič, Martin; Pferschy, Ulrich; Pivač, Nevena; Schauer, Joachim |
|
2023
|
On the Stackelberg knapsack game. Zbl 1487.90565
Pferschy, Ulrich; Nicosia, Gaia; Pacifici, Andrea; Schauer, Joachim |
|
2021
|
Approximating the product knapsack problem. Zbl 1477.90089
Pferschy, Ulrich; Schauer, Joachim; Thielen, Clemens |
|
2021
|
Allocating indivisible items with minimum dissatisfaction on preference graphs. Zbl 07670910
Chiarelli, Nina; Dallard, Clément; Darmann, Andreas; Lendl, Stefan; Milanič, Martin; Muršič, Peter; Pivač, Nevena; Pferschy, Ulrich |
|
2021
|
Optimally rescheduling jobs with a last-in-first-out buffer. Zbl 1480.90137
Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich; Resch, Julia; Righini, Giovanni |
|
2021
|
Fair packing of independent sets. Zbl 07601005
Chiarelli, Nina; Krnc, Matjaž; Milanič, Martin; Pferschy, Ulrich; Pivač, Nevena; Schauer, Joachim |
|
2020
|
A Stackelberg knapsack game with weight control. Zbl 1443.91085
Pferschy, Ulrich; Nicosia, Gaia; Pacifici, Andrea |
|
2019
|
Integer optimization with penalized fractional values: the knapsack case. Zbl 1403.90579
Malaguti, Enrico; Monaci, Michele; Paronuzzi, Paolo; Pferschy, Ulrich |
|
2019
|
New exact approaches and approximation results for the penalized knapsack problem. Zbl 1411.90292
Della Croce, Federico; Pferschy, Ulrich; Scatamacchia, Rosario |
|
2019
|
Geometric and LP-based heuristics for angular travelling salesman problems in the plane. Zbl 1458.90561
Staněk, Rostislav; Greistorfer, Peter; Ladner, Klaus; Pferschy, Ulrich |
|
2019
|
On approximating the incremental knapsack problem. Zbl 1423.90218
Della Croce, Federico; Pferschy, Ulrich; Scatamacchia, Rosario |
|
2019
|
Improved dynamic programming and approximation results for the knapsack problem with setups. Zbl 1391.90531
Pferschy, Ulrich; Scatamacchia, Rosario |
|
2018
|
Approximation results for the incremental knapsack problem. Zbl 1504.90117
Della Croce, Federico; Pferschy, Ulrich; Scatamacchia, Rosario |
|
2018
|
Approximating the 3-period incremental knapsack problem. Zbl 1416.90041
Della Croce, Federico; Pferschy, Ulrich; Scatamacchia, Rosario |
|
2018
|
Approximation of knapsack problems with conflict and forcing graphs. Zbl 1376.90052
Pferschy, Ulrich; Schauer, Joachim |
|
2017
|
Price of fairness for allocating a bounded resource. Zbl 1394.91252
Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich |
|
2017
|
Generating subtour elimination constraints for the TSP from pure integer solutions. Zbl 1364.90296
Pferschy, Ulrich; Staněk, Rostislav |
|
2017
|
Minimization and maximization versions of the quadratic travelling salesman problem. Zbl 1375.90265
Oswin, Aichholzer; Fischer, Anja; Fischer, Frank; Meier, J. Fabian; Pferschy, Ulrich; Pilz, Alexander; Staněk, Rostislav |
|
2017
|
On the shortest path game. Zbl 1351.05152
Darmann, Andreas; Pferschy, Ulrich; Schauer, Joachim |
|
2017
|
Approximation of the quadratic knapsack problem. Zbl 1343.90080
Pferschy, Ulrich; Schauer, Joachim |
|
2016
|
Maximin fairness in project budget allocation. Zbl 1358.91072
Naldi, Maurizio; Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich |
|
2016
|
Linear models and computational experiments for the quadratic TSP. Zbl 1364.90289
Fischer, Anja; Meier, J. Fabian; Pferschy, Ulrich; Staněk, Rostislav |
|
2016
|
Scheduling two agent task chains with a central selection mechanism. Zbl 1320.90020
Agnetis, Alessandro; Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich |
|
2015
|
Two agent scheduling with a central selection mechanism. Zbl 1329.90067
Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich |
|
2015
|
The Subset Sum game. Zbl 1339.91069
Darmann, Andreas; Nicosia, Gaia; Pferschy, Ulrich; Schauer, Joachim |
|
2014
|
The shortest path game: complexity and algorithms. Zbl 1417.68065
Darmann, Andreas; Pferschy, Ulrich; Schauer, Joachim |
|
2014
|
Approximating the quadratic knapsack problem on special graph classes. Zbl 1417.68163
Pferschy, Ulrich; Schauer, Joachim |
|
2014
|
Exact solution of the robust knapsack problem. Zbl 1348.90549
Monaci, Michele; Pferschy, Ulrich; Serafini, Paolo |
|
2013
|
The maximum flow problem with disjunctive constraints. Zbl 1275.90120
Pferschy, Ulrich; Schauer, Joachim |
|
2013
|
On the robust knapsack problem. Zbl 1306.90134
Monaci, Michele; Pferschy, Ulrich |
|
2013
|
Strategies in competing subset selection. Zbl 1272.91017
Marini, Claudia; Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich |
|
2013
|
Two agents competing for a shared machine. Zbl 1404.90071
Agnetis, Alessandro; Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich |
|
2013
|
Committee selection under weight constraints. Zbl 1247.91052
Klamler, Christian; Pferschy, Ulrich; Ruzika, Stefan |
|
2012
|
Paths, trees and matchings under disjunctive constraints. Zbl 1228.05186
Darmann, Andreas; Pferschy, Ulrich; Schauer, Joachim; Woeginger, Gerhard J. |
|
2011
|
The maximum flow problem with conflict and forcing conditions. Zbl 1345.05040
Pferschy, Ulrich; Schauer, Joachim |
|
2011
|
Competitive subset selection with two agents. Zbl 1227.90042
Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich |
|
2011
|
Finding socially best spanning treesî. Zbl 1209.91067
Darmann, Andreas; Klamler, Christian; Pferschy, Ulrich |
|
2011
|
The multidimensional knapsack problem: structure and algorithms. Zbl 1243.90190
Puchinger, Jakob; Raidl, Günther R.; Pferschy, Ulrich |
|
2010
|
Resource allocation with time intervals. Zbl 1208.90058
Darmann, Andreas; Pferschy, Ulrich; Schauer, Joachim |
|
2010
|
A note on maximizing the minimum voter satisfaction on spanning trees. Zbl 1232.91174
Darmann, Andreas; Klamler, Christian; Pferschy, Ulrich |
|
2010
|
The knapsack problem with conflict graphs. Zbl 1194.68175
Pferschy, Ulrich; Schauer, Joachim |
|
2009
|
Inverse 1-center location problems with edge length augmentation on trees. Zbl 1180.90163
Alizadeh, Behrooz; Burkard, Rainer E.; Pferschy, Ulrich |
|
2009
|
Determining a minimum spanning tree with disjunctive constraints. Zbl 1260.68171
Darmann, Andreas; Pferschy, Ulrich; Schauer, Joachim |
|
2009
|
Maximizing the minimum voter satisfaction on spanning trees. Zbl 1177.91068
Darmann, Andreas; Klamler, Christian; Pferschy, Ulrich |
|
2009
|
Committee selection with a weight constraint based on lexicographic rankings of individuals. Zbl 1260.91087
Klamler, Christian; Pferschy, Ulrich; Ruzika, Stefan |
|
2009
|
Subset weight maximization with two competing agents. Zbl 1260.91110
Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich |
|
2009
|
A multi-commodity flow approach for the design of the last mile in real-world fiber optic networks. Zbl 1209.90365
Wagner, Daniel; Raidl, Günther; Pferschy, Ulrich; Mutzel, Petra; Bachhiesl, Peter |
|
2007
|
The traveling group problem. Zbl 1180.91110
Klamler, Christian; Pferschy, Ulrich |
|
2007
|
ILP models for a nurse scheduling problem. Zbl 1209.90217
Klinz, Bettina; Pferschy, Ulrich; Schauer, Joachim |
|
2007
|
An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Zbl 1085.90061
Ljubić, Ivana; Weiskircher, René; Pferschy, Ulrich; Klau, Gunnar W.; Mutzel, Petra; Fischetti, Matteo |
|
2006
|
The core concept for the Multidimensional Knapsack problem. Zbl 1401.90198
Puchinger, Jakob; Raidl, Günther R.; Pferschy, Ulrich |
|
2006
|
Modified subset sum heuristics for bin packing. Zbl 1184.68661
Caprara, Alberto; Pferschy, Ulrich |
|
2005
|
Knapsack problems. Zbl 1103.90003
Kellerer, Hans; Pferschy, Ulrich; Pisinger, David |
|
2004
|
Improved dynamic programming in connection with an FPTAS for the knapsack problem. Zbl 1058.90070
Kellerer, Hans; Pferschy, Ulrich |
|
2004
|
Worst-case analysis of the subset sum algorithm for bin packing. Zbl 1060.90061
Caprara, Alberto; Pferschy, Ulrich |
|
2004
|
An efficient fully polynomial approximation scheme for the Subset-Sum problem. Zbl 1045.68157
Kellerer, Hans; Mansini, Renata; Pferschy, Ulrich; Speranza, Maria Grazia |
|
2003
|
Approximation schemes for ordered vector packing problems. Zbl 1045.90055
Caprara, Alberto; Kellerer, Hans; Pferschy, Ulrich |
|
2003
|
A 3/4-approximation algorithm for multiple subset sum. Zbl 1035.90068
Caprara, Alberto; Kellerer, Hans; Pferschy, Ulrich |
|
2003
|
The fractional prize-collecting Steiner tree problem on trees (extended abstract). Zbl 1266.90188
Klau, Gunnar W.; Ljubić, Ivana; Mutzel, Petra; Pferschy, Ulrich; Weiskircher, René |
|
2003
|
Approximating multiobjective knapsack problems. Zbl 1232.90324
Erlebach, Thomas; Kellerer, Hans; Pferschy, Ulrich |
|
2002
|
Approximating multi-objective knapsack problems. Zbl 1018.90034
Erlebach, Thomas; Kellerer, Hans; Pferschy, Ulrich |
|
2001
|
Approximation schemes for ordered vector packing problems. Zbl 1010.90063
Caprara, Alberto; Kellerer, Hans; Pferschy, Ulrich |
|
2001
|
Approximation algorithms for knapsack problems with cardinality constraints. Zbl 0961.90131
Caprara, Alberto; Kellerer, Hans; Pferschy, Ulrich; Pisinger, David |
|
2000
|
The multiple subset sum problem. Zbl 1010.90070
Caprara, Alberto; Kellerer, Hans; Pferschy, Ulrich |
|
2000
|
A PTAS for the multiple subset sum problem with different knapsack capacities. Zbl 1014.68225
Caprara, Alberto; Kellerer, Hans; Pferschy, Ulrich |
|
2000
|
A new fully polynomial time approximation scheme for the Knapsack problem. Zbl 0957.90112
Kellerer, Hans; Pferschy, Ulrich |
|
1999
|
Cardinality constrained bin-packing problems. Zbl 0955.90106
Kellerer, Hans; Pferschy, Ulrich |
|
1999
|
Dynamic programming revisited: Improving knapsack algorithms. Zbl 0946.90053
Pferschy, U. |
|
1999
|
Stochastic analysis of greedy algorithms for the subset sum problem. Zbl 0941.90064
Pferschy, Ulrich |
|
1999
|
A new fully polynomial approximation scheme for the knapsack problem. Zbl 0908.90190
Kellerer, Hans; Pferschy, Ulrich |
|
1998
|
Solution methods and computational investigations for the linear bottleneck assignment problem. Zbl 0894.90127
Pferschy, U. |
|
1997
|
Simple but efficient approaches for the collapsing knapsack problem. Zbl 0881.90098
Pferschy, Ulrich; Pisinger, David; Woeginger, Gerhard J. |
|
1997
|
An efficient approximation scheme for the subset-sum problem. Zbl 0888.90123
Kellerer, Hans; Pferschy, Ulrich; Speranza, Maria Grazia |
|
1997
|
Greedy algorithms for on-line data compression. Zbl 0895.68062
Békési, József; Galambos, Gábor; Pferschy, Ulrich; Woeginger, Gerhard J. |
|
1997
|
The random linear bottleneck assignment problem. Zbl 0868.90083
Pferschy, U. |
|
1996
|
The fractional greedy algorithm for data compression. Zbl 0842.94007
Békési, J.; Galambos, G.; Pferschy, U.; Woeginger, G. J. |
|
1996
|
The inverse-parametric knapsack problem. Zbl 0904.90121
Burkard, Rainer E.; Pferschy, Ulrich |
|
1995
|
On three topics in combinatorial optimization. Zbl 0864.90107
Pferschy, Ulrich |
|
1995
|
Monge matrices make maximization manageable. Zbl 0822.90112
Pferschy, Ulrich; Rudolf, Rüdiger; Woeginger, Gerhard J. |
|
1994
|
Linear programs with an additional rank two reverse convex constraint. Zbl 0802.90084
Pferschy, Ulrich; Tuy, Hoang |
|
1994
|
Partitioning graphs into two trees. Zbl 0820.68089
Pferschy, Ulrich; Woeginger, Gerhard J.; Yao, En-Yu |
|
1994
|