An Enumeration Algorithm for Knapsack Problems

A. Victor Cabot
Additional contact information
A. Victor Cabot: Indiana University, Bloomington, Indiana

Operations Research, 1970, vol. 18, issue 2, 306-311

Abstract: Enumeration techniques have been shown to be successful for solving integer linear programming problems. The purpose of this paper is to apply the enumeration philosophy to the classical knapsack problem; it shows that this approach applies quite naturally to this type of integer linear program when combined with the Fourier-Motzkin elimination method for solving linear inequalities. Some computational results are reported.

Date: 1970
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.18.2.306 (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:oropre:v:18:y:1970:i:2:p:306-311

Access Statistics for this article

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