Computing closely matching upper and lower bounds on textile nesting problems

DOI10.1016/S0377-2217(97)00049-0MaRDI QIDQ1296780zbMATH OpenOpenAlexFDO

Authors R. 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

simulated annealinglower boundsnestingpackingupper boundsbranch-and-bound methodsindustrial cutting problemtextile manufacturing

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1313602
• A simulated annealing approach to the nesting problem in the textile manufacturing industry
• Bounds for Two-Dimensional Cutting
• scientific article; zbMATH DE number 437550

Cites work

• scientific article; zbMATH DE number 437550 (Why is no real title available?)
• scientific article; zbMATH DE number 686974 (Why is no real title available?)
• scientific article; zbMATH DE number 910876 (Why is no real title available?)
• A simulated annealing approach to the nesting problem in the textile manufacturing industry
• An approach to two-dimensional cutting stock problems
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
• Optimal packing and covering in the plane are NP-complete
• Packing problems
• Solution approaches to irregular nesting problems
• Some experiments with simulated annealing techniques for packing problems
• The nesting problem in the leather manufacturing industry

Cited in

(8)

• Two-dimensional profile-packing approach for multi-torch flame cutting
• Solution for textile nesting problems using adaptive meta-heuristics and grouping
• A beam search implementation for the irregular shape packing problem
• A simulated annealing approach to the nesting problem in the textile manufacturing industry
• The sequential value correction method for the two-dimensional irregular cutting stock problem
• Approximation algorithms for aligning points
• Approximate unions of lines and Minkowski sums
• Scandinavian thins on top of cake: new and improved algorithms for stacking and packing

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

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