Back to Search Start Over

A BRANCH SEARCH ALGORITHM FOR THE KNAPSACK PROBLEM.

Authors :
Greenberg, Harold
Hegerich, Robert L.
Source :
Management Science; Jan1970, Vol. 16 Issue 5, p327-332, 6p
Publication Year :
1970

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. [ABSTRACT FROM AUTHOR]

Subjects

Subjects :
KNAPSACK problems
INTEGER programming
MATHEMATICAL programming
BRANCH & bound algorithms
ALGORITHMS
NETWORK analysis (Planning)
MATHEMATICAL optimization
COMPUTER programming
MATHEMATICAL models
MATHEMATICAL analysis
OPERATIONS research
PROBLEM solving

Details

Language :
English
ISSN :
00251909
Volume :
16
Issue :
5
Database :
Complementary Index
Journal :
Management Science
Publication Type :
Academic Journal
Accession number :
7110085
Full Text :
https://doi.org/10.1287/mnsc.16.5.327
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details