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

DOI10.1080/03155986.1995.11732276zbMATH Open0833.90097OpenAlexW2403558388WikidataQ57719582 ScholiaQ57719582MaRDI QIDQ4849262FDOQ4849262

Authors: Reinaldo Morabito, Marcos N. 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

Recommendations

• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• scientific article; zbMATH DE number 1094768
• A comparative numerical analysis for the guillotine two-dimensional cutting problem
• A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems

zbMATH Keywords

graph searchtwo-dimensional cuttingrectangular platetwo stages

Mathematics Subject Classification ID

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

Cited In (18)

• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• An introduction to the two‐dimensional rectangular cutting and packing problem
• Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
• An efficient approach for large-scale two-dimensional guillotine cutting stock problems
• A linear optimization approach to the combined production planning model
• Title not available (Why is that?)
• An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem
• Solving a large cutting problem in the glass manufacturing industry
• The cutting stock problem in a hardboard industry: A case study.
• An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
• An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
• Two-staged guillotine cut, two-dimensional bin packing optimisation with flexible bin size for steel mother plate design
• A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
• A population heuristic for constrained two-dimensional non-guillotine cutting
• Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
• Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
• An exact algorithm for the knapsack sharing problem
• A comparative numerical analysis for the guillotine two-dimensional cutting problem

This page was built for publication: Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems

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