A o(n logn) algorithm for LP knapsacks with GUB constraints
- 1 December 1979
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 17 (1) , 345-361
- https://doi.org/10.1007/bf01588255
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On One-Row Linear ProgramsPublished by Springer Nature ,1980
- The Multiple-Choice Knapsack ProblemOperations Research, 1979
- Network Application in Industry and GovernmentA I I E Transactions, 1977
- Resolution of the 0–1 knapsack problem: Comparison of methodsMathematical Programming, 1975
- Surrogate Constraint Duality in Mathematical ProgrammingOperations Research, 1975
- An Interactive Procedure for Sizing and Timing Distribution Substations Using Optimization TechniquesIEEE Transactions on Power Apparatus and Systems, 1974
- Convexity cuts for multiple choice problemsDiscrete Mathematics, 1973
- An integer programming approach to a class of combinatorial problemsMathematical Programming, 1972
- Surrogate Mathematical ProgrammingOperations Research, 1970
- A Branch Search Algorithm for the Knapsack ProblemManagement Science, 1970