A comparative numerical analysis for the guillotine two-dimensional cutting problem
From MaRDI portal
Publication:1593538
DOI10.1023/A:1018915922011zbMath0966.90063MaRDI QIDQ1593538
Daniel Sales, Rodrigo Palma, 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
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
68R10: Graph theory (including graph drawing) in computer science
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
An introduction to the two‐dimensional rectangular cutting and packing problem, An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems, A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem, Multi-dimensional bin packing problems with guillotine constraints, 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