Research Archive

A branch and bound algorithm for the knapsack problem

Publication type: Journal article

Research Archive Topic: Operations, Risk Management


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.
Download PDF


Kolesar, Peter. "A branch and bound algorithm for the knapsack problem." Management Science 13, no. 9 (May 1967): 723-735.

Each author name for a Columbia Business School faculty member is linked to a faculty research page, which lists additional publications by that faculty member.

Each topic is linked to an index of publications on that topic.