A Local Optimization-based Solution to the Rectangle Layout Problem

DOI10.1057/JORS.1996.58MaRDI QIDQ4717142zbMATH OpenOpenAlexFDO

Authors Patrick Healy, Robert Moll

Publication date 9 June 1997

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1996.58

zbMATH Keywords

heuristicscutting stockrectangle layout

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Nonlinear programming (90C30)

Recommendations

• A global optimization algorithm for the layout problem of rectangular pieces based on the maximal planar graph
• An algorithm of global optimization for solving layout problems
• Local search algorithms for the rectangle packing problem with general spatial costs
• Local optimization method in placement problems of polygons
• An optimal algorithm for rectangle placement
• Local Search Algorithms for the Maximal Planar Layout Problem
• Improved local search algorithms for the rectangle packing problem with general spatial costs
• scientific article; zbMATH DE number 1286420
• The rectangular packing problem: local optimum search methods based on block structures
• scientific article; zbMATH DE number 238410

Cited in

(4)

• An algorithm of global optimization for solving layout problems
• An improved typology of cutting and packing problems
• An optimal algorithm for rectangle placement
• scientific article; zbMATH DE number 1086894 (Why is no real title available?)

This page was built for publication: A Local Optimization-based Solution to the Rectangle Layout Problem

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