An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
From MaRDI portal
(Redirected from Publication:337083)
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
Cites work
- scientific article; zbMATH DE number 1175962 (Why is no real title available?)
- A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
- A comparative numerical analysis for the guillotine two-dimensional cutting problem
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- An Algorithm for Two-Dimensional Cutting Problems
- An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
- An improved typology of cutting and packing problems
- Exact algorithms for large-scale unconstrained two and three staged cutting problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- The G4-Heuristic for the Pallet Loading Problem
- The Theory and Computation of Knapsack Functions
- Two-dimensional packing problems: a survey
Cited in
(18)- 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 improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
- 2DPackLib: a two-dimensional cutting and packing library
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- Exact solution techniques for two-dimensional cutting and packing
- An Optimum Solution for One-Dimensional Slitting Problems: A Dynamic Programming Approach
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
- Modeling two-dimensional guillotine cutting problems via integer programming
- A new dynamic programming procedure for three-staged cutting patterns
- Exact approaches for the unconstrained two-dimensional cutting problem with defects
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- Strip based compact formulation for two-dimensional guillotine cutting problems
- A comparative numerical analysis for the guillotine two-dimensional cutting problem
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
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)