Regular packing of congruent polygons on the rectangular sheet

DOI10.1016/S0377-2217(98)00050-2zbMath0941.90065OpenAlexW1966012702MaRDI QIDQ1124824

A. V. Pankratov, Yu. G. Stoyan

Publication date: 7 August 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00050-2

zbMATH Keywords

modelingcombinatorial optimizationpackingcutting

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

Tools of mathematical modeling of arbitrary object packing problems ⋮ Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet

Cites Work

• Packing problems
• Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
• A typology of cutting and packing problems
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Regular packing of congruent polygons on the rectangular sheet