An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- 31 May 1977
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 1 (3), 169-175
- https://doi.org/10.1016/0377-2217(77)90024-8
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A Polynomial-Time Algorithm for the Knapsack Problem with Two VariablesJournal of the ACM, 1976
- Approximate Algorithms for the 0/1 Knapsack ProblemJournal of the ACM, 1975
- Computing Partitions with Applications to the Knapsack ProblemJournal of the ACM, 1974
- Reduction Algorithm for Zero-One Single Knapsack ProblemsManagement Science, 1973
- Technical Note—Solution of the Value-Independent Knapsack Problem by PartitioningOperations Research, 1973
- A Branch Search Algorithm for the Knapsack ProblemManagement Science, 1970
- A Branch and Bound Algorithm for the Knapsack ProblemManagement Science, 1967
- A Finite Renewal Algorithm for the Knapsack and Turnpike ModelsOperations Research, 1967
- The Theory and Computation of Knapsack FunctionsOperations Research, 1966
- Discrete-Variable Extremum ProblemsOperations Research, 1957