An Algorithm for the Solution of 0-1 Loading Problems

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

Operations Research, 1975, vol. 23, issue 6, 1110-1119

Abstract: An enumerative algorithm is presented for the solution of 0-1 many-knapsack or loading problems. It is based on the principle that before a search is attempted as many decisions as possible should be made about inclusion or exclusion of objects from the knapsacks. This is accomplished by the introduction of a new ordering relation among the objects. This ordering relation, coupled with other relations we define, allows a drastic reduction in the extent of the search required to determine a solution.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.6.1110 (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:23:y:1975:i:6:p:1110-1119

Access Statistics for this article

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