An algorithm for 0‐1 multiple‐knapsack problems
- 1 September 1978
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 25 (3), 571-579
- https://doi.org/10.1002/nav.3800250316
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- An algorithm for a class of loading problemsNaval Research Logistics Quarterly, 1978
- A branch and bound algorithm for the generalized assignment problemMathematical Programming, 1975
- Surrogate Constraint Duality in Mathematical ProgrammingOperations Research, 1975
- The knapsack problem: A surveyNaval Research Logistics Quarterly, 1975
- Lagrangean relaxation for integer programmingPublished by Springer Science and Business Media LLC ,1974
- Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming ProblemsManagement Science, 1973
- Integer Programming Algorithms: A Framework and State-of-the-Art SurveyManagement Science, 1972
- The Loading ProblemManagement Science, 1971
- An Improved Implicit Enumeration Approach for Integer ProgrammingOperations Research, 1969
- Surrogate ConstraintsOperations Research, 1968