Skip to main content
Article thumbnail
Location of Repository

The Loading Problem

By Samuel Eilon and Nicos Christofides

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.

DOI identifier: 10.1287/mnsc.17.5.259
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://dx.doi.org/10.1287/mnsc... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.