A computational study of a multiple-choice knapsack algorithm
- 1 June 1983
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 9 (2), 184-198
- https://doi.org/10.1145/357456.357458
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- A o(n logn) algorithm for LP knapsacks with GUB constraintsMathematical Programming, 1979
- The Multiple-Choice Knapsack ProblemOperations Research, 1979
- A mathematical programming system for preference and compatibility maximized menu planning and schedulingMathematical Programming, 1978
- Surrogate Constraint Duality in Mathematical ProgrammingOperations Research, 1975
- Lagrangean relaxation for integer programmingPublished by Springer Science and Business Media LLC ,1974
- An integer programming approach to a class of combinatorial problemsMathematical Programming, 1972
- Integer Programming Algorithms: A Framework and State-of-the-Art SurveyManagement Science, 1972
- Three Problems in Rationing CapitalThe Journal of Business, 1955