Improved Lower Bound for Online Strip Packing (Extended Abstract)

Harren, Rolf and Kern, Walter (2011) Improved Lower Bound for Online Strip Packing (Extended Abstract). In: Approximation and Online Algorithms. Lecture Notes in Computer Science, 7164 . Springer, Berlin, Germany, pp. 211-218. ISBN 9783642291166

PDF
Restricted to UT campus only
214Kb

Abstract:	In the two-dimensional strip packing problem a number of rectangles have to be packed without rotation or overlap into a strip such that the height of the strip used is minimal. The width of the rectangles is bounded by 1 and the strip haswidth 1 and infinite height.
Item Type:	Book Section
Copyright:	© 2011 Springer
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/79990
Official URL:	http://dx.doi.org/10.1007/978-3-642-29116-6_18
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page