Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems

DOI10.1080/03155986.1995.11732276zbMath0833.90097OpenAlexW2403558388WikidataQ57719582 ScholiaQ57719582MaRDI QIDQ4849262

Reinaldo Morabito, Marcos Nereu Arenales

Publication date: 9 November 1995

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1995.11732276

zbMATH Keywords

rectangular plategraph searchtwo-dimensional cuttingtwo stages

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items

An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ The cutting stock problem in a hardboard industry: A case study. ⋮ A linear optimization approach to the combined production planning model ⋮ An exact algorithm for the knapsack sharing problem ⋮ Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem ⋮ Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach