Management Science · 1967 · 209 citations · 10 references
ComputingComputer ScienceAlgorithmsOptimizationTheory Of ComputationApproximation AlgorithmsBranch And BoundCombinatorial OptimizationInteger ProgrammingLinear ProgrammingOptimization TheoryBin PackingBin Packing ProblemKnapsack ApproximationKnapsack Problems
A branch and bound algorithm for solution of the “knapsack problem,” max ∑ v i x i where ∑ w i x i ≦ W and x i = 0, 1, is presented which can obtain either optimal or approximate solutions. Some characteristics of the algorithm are discussed and computational experience is presented. Problems involving 50 items from which approximately 25 items were loaded were solved in an average of 0.07 minutes each by a coded version of this algorithm for the IBM 7094 computer.
10
Marshall Freimer, Richard Bellman, Stuart E. Dreyfus · Journal of the American Statistical Association · 1964 · 2.2K citations
Branch-and-Bound Methods: A Survey
Eugene L. Lawler, Derek Wood · Operations Research · 1966 · 2K citations
An Algorithm for the Traveling Salesman Problem
John D. C. Little, Katta G. Murty, Dura W. Sweeney et al. · Operations Research · 1963 · 1K citations · Full text