A Branch Search Algorithm for the Knapsack Problem

Harold Greenberg and Robert L. Hegerich
Additional contact information
Harold Greenberg: Naval Postgraduate School
Robert L. Hegerich: Naval Postgraduate School

Management Science, 1970, vol. 16, issue 5, 327-332

Abstract: 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.

Date: 1970
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.16.5.327 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:16:y:1970:i:5:p:327-332

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().