Back to University of Twente portal

Login

UTpublications

Home About Upload Latest Additions Statistics Contact

UT Student Theses

Dutch Academic Output Dutch Dissertations EU Publications (OpenAIRE)

Advanced search

A note on the lower bound for online strip packing

Kern, W. and Paulus, J.J. (2009) A note on the lower bound for online strip packing. [Report]

[img]

Preview

PDF
114Kb

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:	Report
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/65403
Official URL:	http://www.math.utwente.nl/publications/
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Education
▪ Behavioural Sciences
▪ Management and Governance
▪ Engineering Technology
▪ Electrical Engineering, Mathematics and Computer Science
▪ Science and Technology
▪ Geo-Information Science and Earth Observation
▪ Overview programmes

Research
▪ Centre for Telematics and Information Technology
▪ Institute for Behavioral Research
▪ Institute for Innovation and Governance Studies
▪ Institute of Mechanics, Processes and Control
▪ Mesa+ Institute for Nanotechnology
▪ MIRA Biomedical Technology and Technical Medicine

Cooperation
▪ Alumni
▪ Universiteitsfonds
▪ Kennispark Twente
▪ Entrepreneurs
▪ The Science Shop
▪ Press