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
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
Cites work
- scientific article; zbMATH DE number 719668 (Why is no real title available?)
- scientific article; zbMATH DE number 1175962 (Why is no real title available?)
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- A comparative numerical analysis for the guillotine two-dimensional cutting problem
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- A typology of cutting and packing problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An AND/OR-graph approach to the container loading problem
- An Algorithm for Two-Dimensional Cutting Problems
- An and-or-graph approach for two-dimensional cutting problems
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An improved typology of cutting and packing problems
- An improved version of Wang's algorithm for two-dimensional cutting problems
- 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
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
- Exact solutions for constrained two-dimensional cutting problems
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- Lower bounds from state space relaxations for concave cost network flow problems
- Packing problems
- Solution for the constrained Guillotine cutting problem by simulated annealing
- 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
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
- The Theory and Computation of Knapsack Functions
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Two-dimensional packing problems: a survey
- Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
Cited in
(25)- And/or-convexity: a graph convexity based on processes and deadlock models
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover
- Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
- Revisiting the complexity of and/or graph solution
- 2DPackLib: a two-dimensional cutting and packing library
- Tractability, hardness, and kernelization lower bound for and/or graph solution
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- An exact rectangular two-segment layout algorithm with optimal same-shape strip generation
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems
- 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 anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
- scientific article; zbMATH DE number 1094768 (Why is no real title available?)
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
- Fast heuristic for constrained homogenous T-shape cutting patterns
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- Strip based compact formulation for two-dimensional guillotine cutting problems
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
- An introduction to the two‐dimensional rectangular cutting and packing problem
- An and-or-graph approach for two-dimensional cutting problems
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
- An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
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)
