Use this URL to cite or link to this record in EThOS:
Title: Worst-case bounds for bin-packing heuristics with applications to the duality gap of the one-dimensional cutting stock problem
Author: Tuenter, Hans J. H.
ISNI:       0000 0004 2700 8942
Awarding Body: University of Birmingham
Current Institution: University of Birmingham
Date of Award: 1997
Availability of Full Text:
Access from EThOS:
Access from Institution:
The thesis considers the one-dimensional cutting stock problem, the bin-packing problem, and their relationship. The duality gap of the former is investigated and a characterisation of a class of cutting stock problems with the next round-up property is given. It is shown that worst-case bounds for bin-packing heuristics can be and are best expressed in terms of the linear programming relaxation of the corresponding cutting stock problem. The concept of recurrency is introduced for a bin-packing heuristic, which allows a more natural derivation of a measure for the worst-case behaviour. The ideas are tested on some well known bin-packing heuristics and (slightly) tighter bounds for these are derived. These new bounds (in terms of the linear programming relaxation) are then used to make inferences about the duality gap of the cutting stock problem. In particular; these bounds allow à priori, problem-specific bounds. The thesis ends with conclusions and a number of suggestions to extend the analysis to higher dimensional problems.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: QA Mathematics ; T Technology (General)