Reduction Algorithm for Zero-One Single Knapsack Problems

Giorgio P. Ingargiola and James F. Korsh
Additional contact information
Giorgio P. Ingargiola: California Institute of Technology
James F. Korsh: California Institute of Technology

Management Science, 1973, vol. 20, issue 4-Part-I, 460-463

Abstract: A simple algorithm is described for the reduction of 0-1 single knapsack problems to significantly smaller problems. The time required by the reduction algorithm is proportional to the number of variables. When used in conjunction with available algorithms for knapsack problems it substantially reduces total time and space requirements.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.20.4.460 (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:20:y:1973:i:4-part-i:p:460-463

Access Statistics for this article

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