AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints
- 1 February 1984
- journal article
- research article
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 28 (1) , 29-40
- https://doi.org/10.1007/bf01919085
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983
- The Linear Multiple Choice Knapsack ProblemOperations Research, 1980
- An Algorithm for Large Zero-One Knapsack ProblemsOperations Research, 1980
- A o(n logn) algorithm for LP knapsacks with GUB constraintsMathematical Programming, 1979
- Combinatorial Optimization with Rational Objective FunctionsMathematics of Operations Research, 1979
- The Multiple-Choice Knapsack ProblemOperations Research, 1979
- Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $SIAM Journal on Computing, 1978