You are not currently logged in.
Access JSTOR through your library or other institution:
A Branch and Bound Algorithm for the Knapsack Problem
Peter J. Kolesar
Vol. 13, No. 9, Series A, Sciences (May, 1967), pp. 723-735
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/2628089
Page Count: 13
You can always find the topics here!Topics: Algorithms, Mathematical problems, Operations research, Mathematical objects, Objective functions, Optimal solutions, Integers, Linear programming, Integer programming, Scheduling
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
A branch and bound algorithm for solution of the "knapsack problem," max Σ vixi where Σ wixi ≤ W and xi = 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.
Management Science © 1967 INFORMS