An on-line algorithm for the rectangle packing problem with rejection

DOI10.1007/3-540-44867-5_5MaRDI QIDQ4426345zbMATH OpenFDO

Authors Massimiliano Caramia, Stefano Giordani, Antonio Iovanella

Publication date 16 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2647/26470059.htm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• On-line algorithms for packing rectangles into several strips
• Two-dimensional rectangle packing: On-line methods and results
• On-Line Multiple-Strip Packing
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• Approximate algorithms to pack rectangles into several strips

Cited in

(4)

• An Improved Algorithm for Online Rectangle Filling
• scientific article; zbMATH DE number 634028 (Why is no real title available?)
• On-line algorithms for packing rectangles into several strips
• Online removable square packing

This page was built for publication: An on-line algorithm for the rectangle packing problem with rejection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4426345)