Show simple item record

dc.contributor.advisorMeyerowitz, Jane Julia.
dc.creatorDeighton, Andrew George.
dc.date.accessioned2012-11-19T07:25:15Z
dc.date.available2012-11-19T07:25:15Z
dc.date.created1991
dc.date.issued1991
dc.identifier.urihttp://hdl.handle.net/10413/7876
dc.descriptionThesis (M.Sc.)-University of Natal, Durban, 1991.en
dc.description.abstractBin packing is a problem with many applications in various industries. This thesis addresses a specific instance of the this problem, known as the Container Packing problem. Special attention is paid to the Pallet Loading problem which is a restricted sub-problem of the general Container Packing problem. Since the Bin Packing problem is NP-complete, it is customary to apply a heuristic measure in order to approximate solutions in a reasonable amount of computation time rather than to attempt to produce optimal results by applying some exact algorithm. Several heuristics are examined for the problems under consideration, and the results produced by each are shown and compared where relevant.en
dc.language.isoen_ZAen
dc.subjectNp-complete problems.en
dc.subjectOperations research--Data processing.en
dc.subjectHeuristic programming.en
dc.subjectPackaging--Data processing.en
dc.subjectTheses--Computer science.en
dc.titlePacking problems on a PC.en
dc.typeThesisen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record