Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- 1 January 1985
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 31 (1) , 78-105
- https://doi.org/10.1007/bf02591863
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Formulations and Algorithms for the Capacitated Minimal Directed Tree ProblemJournal of the ACM, 1983
- Calculating surrogate constraintsMathematical Programming, 1980
- An Algorithm for Large Zero-One Knapsack ProblemsOperations Research, 1980
- Pivot and Complement–A Heuristic for 0-1 ProgrammingManagement Science, 1980
- Computational results with a branch‐and‐bound algorithm for the general knapsack problemNaval Research Logistics Quarterly, 1979
- A Dual-Based Procedure for Uncapacitated Facility LocationOperations Research, 1978
- Lagrangean Relaxation Applied to Capacitated Facility Location ProblemsA I I E Transactions, 1978
- Computing Partitions with Applications to the Knapsack ProblemJournal of the ACM, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- An Enumeration Algorithm for Knapsack ProblemsOperations Research, 1970