A hybrid algorithm for the non-Guillotine cutting problem

DOI10.1023/A:1021521523118zbMath1028.90043OpenAlexW180116065MaRDI QIDQ1861925

Víctor Parada, Rodrigo Palma, Muricio Solar, Lorena Pradenas

Publication date: 10 March 2003

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021521523118

zbMATH Keywords

cutting stockheuristic methodstrim loss

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport

This page was built for publication: A hybrid algorithm for the non-Guillotine cutting problem