A Branch Search Algorithm for the Knapsack Problem

Thumbnail Image
Files
Greenberg-Hegerich_A Branch Search Algorithm for the Knapsack Problem_1970.pdf (595.97 KB)
Authors
Greenberg, Harold
Hegerich, Robert L.
Subjects
Advisors
Date of Issue
1970
Date
1970
Publisher
INFORMS
Language
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.
Type
Article
Description
The article of record as published may be found at https://doi.org/10.1287/mnsc.16.5.327
URI
https://hdl.handle.net/10945/70157
Series/Report No
Department
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funder
Format
7 p.
Citation
Harold Greenberg, Robert L. Hegerich, (1970) A Branch Search Algorithm for the Knapsack Problem. Management Science 16(5):327-332.
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Collections
Publications