The Loading Problem

Samuel Eilon and Nicos Christofides
Additional contact information
Samuel Eilon: Imperial College of Science and Technology, London
Nicos Christofides: Imperial College of Science and Technology, London

Management Science, 1971, vol. 17, issue 5, 259-268

Abstract: The loading problem is defined as the allocation of given items with known magnitude to boxes with constrained capacity, so as to minimize the number of boxes required. Two methods of solution are considered: The first is by a zero-one programming model, for which the solution procedure is described; the second is by a heuristic algorithm. Fifty problems were solved by the two methods and in all but two the second method yielded the optimal solution with significantly less computing time than that needed by the first method.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (16)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.17.5.259 (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:17:y:1971:i:5:p:259-268

Access Statistics for this article

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