A Local Optimization-based Solution to the Rectangle Layout Problem

DOI10.1057/JORS.1996.58zbMATH Open0864.90105OpenAlexW2056801206MaRDI QIDQ4717142FDOQ4717142

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

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

zbMATH Keywords

heuristicscutting stockrectangle layout

Mathematics Subject Classification ID

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

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
• Title not available (Why is that?)

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)