Packing problems on a PC.

dc.contributor.advisor	Meyerowitz, Jane Julia.
dc.creator	Deighton, Andrew George.
dc.date.accessioned	2012-11-19T07:25:15Z
dc.date.available	2012-11-19T07:25:15Z
dc.date.created	1991
dc.date.issued	1991
dc.identifier.uri	http://hdl.handle.net/10413/7876
dc.description	Thesis (M.Sc.)-University of Natal, Durban, 1991.	en
dc.description.abstract	Bin 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.iso	en_ZA	en
dc.subject	Np-complete problems.	en
dc.subject	Operations research--Data processing.	en
dc.subject	Heuristic programming.	en
dc.subject	Packaging--Data processing.	en
dc.subject	Theses--Computer science.	en
dc.title	Packing problems on a PC.	en
dc.type	Thesis	en