Computing closely matching upper and lower bounds on textile nesting problems

DOI10.1016/S0377-2217(97)00049-0zbMATH Open0943.90058OpenAlexW2084566137MaRDI QIDQ1296780FDOQ1296780

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

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

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)

Cites Work

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

Cited In (8)

• Solution for textile nesting problems using adaptive meta-heuristics and grouping
• A simulated annealing approach to the nesting problem in the textile manufacturing industry
• A beam search implementation for the irregular shape packing problem
• 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
• Two-dimensional profile-packing approach for multi-torch flame cutting

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)