A comparative numerical analysis for the guillotine two-dimensional cutting problem

DOI10.1023/A:1018915922011MaRDI QIDQ1593538zbMATH OpenOpenAlexFDO

Authors Rodrigo Palma, Daniel Sales, Arlindo Gómes, Víctor Parada

Publication date 17 January 2001

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

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

zbMATH Keywords

heuristicscombinatorial optimizationguillotine cutting stock

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Recommendations

• Modeling two-dimensional guillotine cutting problems via integer programming
• Strip based compact formulation for two-dimensional guillotine cutting problems
• Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems
• Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
• scientific article; zbMATH DE number 166938
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
• An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
• A note on linear models for two-group and three-group two-dimensional guillotine cutting problems
• An efficient approach for large-scale two-dimensional guillotine cutting stock problems

Cited in

(8)

• An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
• A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
• Multi-dimensional bin packing problems with guillotine constraints
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
• An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
• An introduction to the two‐dimensional rectangular cutting and packing problem
• scientific article; zbMATH DE number 3980922 (Why is no real title available?)

This page was built for publication: A comparative numerical analysis for the guillotine two-dimensional cutting problem

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