A sliding algorithm for optimal nesting of arbitrarily shaped sheet metal blanks
From MaRDI portal
Publication:4398989
DOI10.1080/00207549508930225zbMath0917.90241OpenAlexW2093574755MaRDI QIDQ4398989
No author found.
Publication date: 18 July 1999
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207549508930225
Related Items
Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet ⋮ Two-dimensional profile-packing approach for multi-torch flame cutting ⋮ Rotational polygon overlap minimization and compaction
Cites Work
- A Linear Programming Approach to the Cutting-Stock Problem
- Performance testing of rectangular parts-nesting heuristics
- An approach to two-dimensional cutting stock problems
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Multistage Cutting Stock Problems of Two and More Dimensions
- A Multistage Solution of the Template-Layout Problem