If you need an accessible version of this item please contact JSTOR User Support

A Branch and Bound Algorithm for the Knapsack Problem

Peter J. Kolesar
Management Science
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
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
A Branch and Bound Algorithm for the Knapsack Problem
Preview not available

Abstract

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.

Page Thumbnails

  • Thumbnail: Page 
723
    723
  • Thumbnail: Page 
724
    724
  • Thumbnail: Page 
725
    725
  • Thumbnail: Page 
726
    726
  • Thumbnail: Page 
727
    727
  • Thumbnail: Page 
728
    728
  • Thumbnail: Page 
729
    729
  • Thumbnail: Page 
730
    730
  • Thumbnail: Page 
731
    731
  • Thumbnail: Page 
732
    732
  • Thumbnail: Page 
733
    733
  • Thumbnail: Page 
734
    734
  • Thumbnail: Page 
735
    735