We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A BRANCH AND BOUND ALGORITHM FOR THE KNAPSACK PROBLEM.
- Authors
Kolesar, Peter J.
- Abstract
A branch and bound algorithm for solution of the "knapsack problem," max Σ v[sub i],x[sub i] where Σ w[sub i]x[sub i] ≤ W and x[sub i] = 0, 1, is presented which can obtain either optimal or approximate solutions. Some characteristics of the algorithm are discussed and computational experience is present. 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.
- Subjects
KNAPSACK problems; ALGORITHMS; INTEGER programming; MATHEMATICAL programming; IBM computers; COMPUTERS; BRANCH &; bound algorithms; OPTIMAL Design &; Analysis of Experiments (Book); OPTIMAL designs (Statistics); COMBINATORICS; CARGO handling; LINEAR programming
- Publication
Management Science, 1967, Vol 13, Issue 9, p723
- ISSN
0025-1909
- Publication type
Article
- DOI
10.1287/mnsc.13.9.723