A heuristic algorithm for the multidimensional zero-one knapsack problem
- 1 June 1984
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 16 (3) , 319-326
- https://doi.org/10.1016/0377-2217(84)90286-8
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- An Algorithm for Large Zero-One Knapsack ProblemsOperations Research, 1980
- Pivot and Complement–A Heuristic for 0-1 ProgrammingManagement Science, 1980
- A HEURISTIC FOR GENERAL INTEGER PROGRAMMING*Decision Sciences, 1974
- Efficient Heuristic Procedures for Integer Linear Programming with an InteriorOperations Research, 1969
- Discrete Dynamic Programming and Capital AllocationManagement Science, 1969
- Letter to the Editor—A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming ProblemOperations Research, 1968
- Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D ProjectsManagement Science, 1967
- Solution of the Lorie-Savage and Similar Integer Programming Problems by the Generalized Lagrange Multiplier MethodOperations Research, 1966
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of ResourcesOperations Research, 1963
- Three Problems in Rationing CapitalThe Journal of Business, 1955