Abstract
AnO (n+r logn) algorithm is presented for the linear programming knapsack problem withr generalized upper bounds andn variables. This result which is based on parametric programming and well-known ideas for the design of linear-time algorithms improvesO (n logn) algorithms given byGlover/Klingman [1979] andZemel [1980].
Zusammenfassung
Es wird einO (n+r logn)-Algorithmus vorgestellt, der LP-Rucksackprobleme mitn Variablen undr verallgemeinerten oberen Schranken für die Variablen löst. Grundlage des Verfahrens ist ein parametrischer Ansatz kombiniert mit bekannten Methoden zur Konstruktion von Algorithmen mit linearer Laufzeit. Der vorgestellte Algorithmus verbessertO (n logn)-Verfahren vonGlover/Klingman [1979] undZemel [1980].
Similar content being viewed by others
References
Balas, E., andE. Zemel: An Algorithm for Large Zero-One Knapsack Problems. Operations Research28, 1980, 1132–1154.
Glover, F., andD. Klingman: AnO (n logn) Algorithm for LP Knapsacks with GUB Constraints. Math. Programming17, 1979, 345–361.
Johnson, D.B., andT. Mizoguchi: Selecting thek-th Element inX+Y andX 1+X2+...+Xm. SIAM J. Comput.7, 1978, 147–153.
Megiddo, N.: Combinatorial Optimization with Rational Objective Functions. Mathematics of Operations Research4, 1979, 414–424.
Megiddo, N.: Linear-Time Algorithms for Linear Programming inR 3 and Related Problems. SIAM J. Comput.12, 1983.
Sinha, P., andA. Zoltners: The Multiple Choice Knapsack Problem. Operations Research27, 1979, 503–515.
Witzgall, C.: On One-Row Linear Programs. Applied Mathematics Division, National Bureau of Standards, 1977.
Zemel, E.: The Linear Multiple Choice Knapsack Problem. Operations Research28, 1980, 1412–1423.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Brucker, P. AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints. Zeitschrift für Operations Research 28, 29–40 (1984). https://doi.org/10.1007/BF01919085
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01919085