Computing closely matching upper and lower bounds on textile nesting problems

DOI10.1016/S0377-2217(97)00049-0zbMath0943.90058OpenAlexW2084566137MaRDI QIDQ1296780

Ralf Heckmann, Thomas Lengauer

Publication date: 3 August 1999

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00049-0

zbMATH Keywords

upper boundssimulated annealingpackinglower boundsnestingbranch-and-bound methodsindustrial cutting problemtextile manufacturing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30) Case-oriented studies in operations research (90B90)

Related Items (6)

Approximation algorithms for aligning points ⋮ Approximate unions of lines and Minkowski sums ⋮ [NO TITLE AVAILABLE] ⋮ Scandinavian thins on top of cake: new and improved algorithms for stacking and packing ⋮ A beam search implementation for the irregular shape packing problem ⋮ Two-dimensional profile-packing approach for multi-torch flame cutting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solution approaches to irregular nesting problems
• Optimal packing and covering in the plane are NP-complete
• Packing problems
• Some experiments with simulated annealing techniques for packing problems
• A simulated annealing approach to the nesting problem in the textile manufacturing industry
• The nesting problem in the leather manufacturing industry
• An approach to two-dimensional cutting stock problems
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography

This page was built for publication: Computing closely matching upper and lower bounds on textile nesting problems