A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
From MaRDI portal
Publication:610985
DOI10.1007/S10479-008-0457-4zbMATH Open1201.90174DBLPjournals/anor/MorabitoP10OpenAlexW1969732427WikidataQ57719493 ScholiaQ57719493MaRDI QIDQ610985FDOQ610985
Reinaldo Morabito, Vitória Pureza
Publication date: 13 December 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0457-4
Recommendations
- scientific article; zbMATH DE number 7778097
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems
- A population heuristic for constrained two-dimensional non-guillotine cutting
- scientific article; zbMATH DE number 1094768
- A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
heuristicsdynamic programmingand/or-graph searchconstrained two-dimensional guillotine cutting patternscutting and packing problems
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- An improved typology of cutting and packing problems
- Two-dimensional packing problems: a survey
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
- A typology of cutting and packing problems
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- Packing problems
- Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Title not available (Why is that?)
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- State-space relaxation procedures for the computation of bounds to routing problems
- An AND/OR-graph approach to the container loading problem
- The Theory and Computation of Knapsack Functions
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- A comparative numerical analysis for the guillotine two-dimensional cutting problem
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
- An improved version of Wang's algorithm for two-dimensional cutting problems
- An and-or-graph approach for two-dimensional cutting problems
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
- Exact solutions for constrained two-dimensional cutting problems
- Solution for the constrained Guillotine cutting problem by simulated annealing
- Lower bounds from state space relaxations for concave cost network flow problems
- Title not available (Why is that?)
Cited In (24)
- Revisiting the complexity of and/or graph solution
- Exact solution techniques for two-dimensional cutting and packing
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
- Strip based compact formulation for two-dimensional guillotine cutting problems
- An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem
- 2DPackLib: a two-dimensional cutting and packing library
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- And/or-convexity: a graph convexity based on processes and deadlock models
- Tractability, hardness, and kernelization lower bound for and/or graph solution
- Title not available (Why is that?)
- Fast heuristic for constrained homogenous T-shape cutting patterns
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
- Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- An and-or-graph approach for two-dimensional cutting problems
- Title not available (Why is that?)
This page was built for publication: A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q610985)
