A Branch Search Algorithm for the Knapsack Problem

This paper presents an algorithm for the solution of the knapsack problem. The method involves searching the nodes of a tree along a single branch at a time. The algorithm eliminates the computational drawbacks inherent in the usual branch and bound schemes.

• 저널Management Science · 16(5) · 327–332
• 토픽Optimization and Packing Problems · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.16.5.327
• 저자Harold Greenberg, Robert Lawrence Hegerich