Computing closely matching upper and lower bounds on textile nesting problems-Reference-Cited by-同舟云学术

Computing closely matching upper and lower bounds on textile nesting problems

Published:1998-08 Issue:3 Volume:108 Page:473-489
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Heckmann Ralf,Lengauer Thomas

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference31 articles.

1. Nesting two-dimensional shapes in rectangular modules;Adamowicz;Computer Aided Design,1976

2. Optimal allocation of two-dimensional irregular shapes using heuristic search methods;Albano;IEEE Transactions on Systems, Man, and Cybernetics,1980

3. Marker-making using automatic placement of irregular shapes for the garment industry;Amaral;Computer & Graphics,1990

4. Efficient nesting of congruent convex figures;Ben-Bassat;Communications of the ACM,1984

5. Algorithms for a marker making system: ε-admissible resolution;Bounsaythip,1995

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Digital Technologies for Lean Manufacturing;Textile Science and Clothing Technology;2022

2. Machine learning-based marker length estimation for garment mass customization;The International Journal of Advanced Manufacturing Technology;2021-03-02

3. A review of artificial intelligence applications in apparel industry;The Journal of The Textile Institute;2021-02-03

4. Sequence Transfer-Based Particle Swarm Optimization Algorithm for Irregular Packing Problems;IEEE Access;2021

5. Packing of Polygonal Pieces;Introduction to Cutting and Packing Optimization;2017-10-24