An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems

DOI10.1016/J.COR.2014.04.001zbMath1348.90554OpenAlexW1963555229MaRDI QIDQ337083

Mauro Russo, Claudio Sterle, Aantonio Sforza

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.04.001

zbMATH Keywords

dynamic programmingguillotine cuttingknapsack function

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (9)

A hybrid dynamic programming for solving fixed cost transportation with discounted mechanism ⋮ Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ Exact approaches for the unconstrained two-dimensional cutting problem with defects ⋮ Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers ⋮ Strip based compact formulation for two-dimensional guillotine cutting problems ⋮ 2DPackLib: a two-dimensional cutting and packing library

Uses Software

• Packlib2

Cites Work

• Unnamed Item
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
• A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
• A comparative numerical analysis for the guillotine two-dimensional cutting problem
• Two-dimensional packing problems: a survey
• An improved typology of cutting and packing problems
• PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
• An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• An Algorithm for Two-Dimensional Cutting Problems
• The G4-Heuristic for the Pallet Loading Problem
• Multistage Cutting Stock Problems of Two and More Dimensions
• The Theory and Computation of Knapsack Functions
• Recursive Computational Procedure for Two-dimensional Stock Cutting
• Exact algorithms for large-scale unconstrained two and three staged cutting problems

This page was built for publication: An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems