Surrogate duality in a branch‐and‐bound procedure
- 1 March 1981
- journal article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 28 (1) , 93-101
- https://doi.org/10.1002/nav.3800280107
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Resolution of the 0–1 knapsack problem: Comparison of methodsMathematical Programming, 1975
- An Enumeration Algorithm for Knapsack ProblemsOperations Research, 1970
- A Branch Search Algorithm for the Knapsack ProblemManagement Science, 1970
- A Branch and Bound Algorithm for the Knapsack ProblemManagement Science, 1967