Enumerating bottom-left stable positions for rectangle placements with overlap

DOI10.15807/JORSJ.57.45MaRDI QIDQ3189326zbMATH OpenOpenAlexFDO

Authors Yuyao Chien, Yuma Tanaka, Shinji Imahori, Mutsunori Yagiura

Publication date 9 September 2014

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.57.45

zbMATH Keywords

bottom-left stable positioncombinatorial optimizationcutting and packingrectangle packing problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• An optimal algorithm for rectangle placement
• scientific article; zbMATH DE number 644289
• scientific article; zbMATH DE number 22188
• An algorithm for polygon placement using a bottom-left strategy
• Optimal rectangle packing: an absolute placement approach

Cited in

(4)

• An algorithm for polygon placement using a bottom-left strategy
• Efficient implementations of construction heuristics for the rectilinear block packing problem
• Models and algorithms for packing rectangles into the smallest square
• Placing Text Boxes on Graphs

This page was built for publication: Enumerating bottom-left stable positions for rectangle placements with overlap

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