EEMCS EPrints Service

Education

Research

Prospective Students

Jobs

Publications

Intranet (internal)

Nederlands

Contact

Sitemap

Organisation

15127 A note on the lower bound for online strip packing

Home Policy Brochure Browse Search User Area Contact Help

Kern, W. and Paulus, J.J. (2009) A note on the lower bound for online strip packing. Memorandum 1893, Department of Applied Mathematics, University of Twente, Enschede. ISSN 1874-4850

Full text available as:

PDF

- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
115 Kb

Official URL: http://www.math.utwente.nl/publications/

Abstract

This note presents a lower bound of $3/2+\sqrt{33}/6 \approx 2.457$ on the competitive ratio for online strip packing. The instance construction we use to obtain the lower bound was first coined by Brown, Baker and Katseff (1980). Recently this instance construction is used to improve the lower bound in computer aided proofs. We derive the best possible lower bound that can be obtained with this instance construction.

Item Type:	Internal Report (Memorandum)
Research Group:	EWI-DMMP: Discrete Mathematics and Mathematical Programming
Research Program:	CTIT-IE&ICT: Industrial Engineering and ICT
Research Project:	BRICKS/IS3: Decision Support Systems for Logistic Networks and Supply Chain Optimization
ID Code:	15127
Deposited On:	20 February 2009
More Information:	statistics metis

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item