Almost square packing

DOI10.1007/978-3-642-21311-3_19MaRDI QIDQ3003288zbMATH OpenOpenAlexFDO

Authors Helmut Simonis, Barry O'Sullivan

Publication date 26 May 2011

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21311-3_19

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• Optimal rectangle packing
• Models and algorithms for packing rectangles into the smallest square
• On packing squares into a rectangle
• Packing into the smallest square: worst-case analysis of lower bounds
• Algorithm Theory - SWAT 2004

Cited in

(4)

• Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem
• Models and algorithms for packing rectangles into the smallest square
• Optimal rectangle packing
• Packing squares independently

This page was built for publication: Almost square packing

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