A solution procedure for general knapsack problems with a few constraints
- 31 December 1988
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 15 (2) , 145-155
- https://doi.org/10.1016/0305-0548(88)90007-x
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Surrogate duality in a branch-and-bound procedure for integer programmingEuropean Journal of Operational Research, 1988
- Zero-one integer programs with few constraints —Efficient branch and bound algorithmsEuropean Journal of Operational Research, 1985
- Zero-one integer programs with few constraints —Lower bounding theoryEuropean Journal of Operational Research, 1985
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning ModelsOperations Research, 1985
- An Applications Oriented Guide to Lagrangian RelaxationInterfaces, 1985
- An Algorithm for the Knapsack ProblemIIE Transactions, 1983
- Computational results with a branch‐and‐bound algorithm for the general knapsack problemNaval Research Logistics Quarterly, 1979
- An Algorithm for Nonlinear Knapsack ProblemsManagement Science, 1976
- Surrogate Constraint Duality in Mathematical ProgrammingOperations Research, 1975
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974