[NO TITLE AVAILABLE]

DOI10.1590/S0101-74382000000200007zbMath1181.90025OpenAlexW2154457302MaRDI QIDQ5189100

O. Y. Sergeyeva, M. A. Verkhoturov

Publication date: 6 March 2010

Published in: Pesquisa Operacional (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1590/s0101-74382000000200007

zbMATH Keywords

heuristicshodographnestingirregular cutting stock problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (1)

A fully general, exact algorithm for nesting irregular shapes

Cites Work

• Computing closely matching upper and lower bounds on textile nesting problems
• A simulated annealing approach to the nesting problem in the textile manufacturing industry
• Using a tabu search approach for solving the two-dimensional irregular cutting problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: [NO TITLE AVAILABLE]