A hybrid algorithm for the non-Guillotine cutting problem

DOI10.1023/A:1021521523118zbMATH Open1028.90043OpenAlexW180116065MaRDI QIDQ1861925FDOQ1861925

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

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

Recommendations

• A tabu search algorithm for a two-dimensional non-guillotine cutting problem
• A Hybrid Optimization Framework for Cutting and Packing Problems
• Computational Science - ICCS 2004
• A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
• A population heuristic for constrained two-dimensional non-guillotine cutting

zbMATH Keywords

cutting stockheuristic methodstrim loss

Mathematics Subject Classification ID

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

Cited In (5)

• A Hybrid Optimization Framework for Cutting and Packing Problems
• Computational Science - ICCS 2004
• An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
• An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport
• Solution for the constrained Guillotine cutting problem by simulated annealing

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

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