An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
From MaRDI portal
Publication:337083
DOI10.1016/J.COR.2014.04.001zbMATH Open1348.90554OpenAlexW1963555229MaRDI QIDQ337083FDOQ337083
Antonio Sforza, Mauro Russo, Claudio Sterle
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
Recommendations
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
- scientific article; zbMATH DE number 7778097
- An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems
Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27) Dynamic programming (90C39)
Cites Work
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- An improved typology of cutting and packing problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- Two-dimensional packing problems: a survey
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- The G4-Heuristic for the Pallet Loading Problem
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- Title not available (Why is that?)
- The Theory and Computation of Knapsack Functions
- A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
- A comparative numerical analysis for the guillotine two-dimensional cutting problem
- An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- Exact algorithms for large-scale unconstrained two and three staged cutting problems
Cited In (15)
- Exact solution techniques for two-dimensional cutting and packing
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
- Strip based compact formulation for two-dimensional guillotine cutting problems
- 2DPackLib: a two-dimensional cutting and packing library
- Exact approaches for the unconstrained two-dimensional cutting problem with defects
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- An Optimum Solution for One-Dimensional Slitting Problems: A Dynamic Programming Approach
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
- 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
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- A new dynamic programming procedure for three-staged cutting patterns
- A comparative numerical analysis for the guillotine two-dimensional cutting problem
Uses Software
This page was built for publication: An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337083)
