An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
From MaRDI portal
(Redirected from Publication:1127217)
Recommendations
- An and-or-graph approach for two-dimensional cutting problems
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- Two-dimensional guillotineable-layout cutting problems with a single defect -- an AND/OR-graph approach
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- Exact solutions for constrained two-dimensional cutting problems
- A hybrid algorithm for the non-Guillotine cutting problem
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
Cites work
- A typology of cutting and packing problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- An and-or-graph approach for two-dimensional cutting problems
- An AND/OR-graph approach to the container loading problem
- An exact algorithm for the pallet loading problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Efficient automated pallet loading
- Multistage Cutting Stock Problems of Two and More Dimensions
- Network flows and non-guillotine cutting patterns
- Packing problems
- Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems
Cited in
(31)- An and-or-graph approach for two-dimensional cutting problems
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- An exact depth-first algorithm for the pallet loading problem
- An efficient algorithm for searching implicit AND/OR graphs with cycles
- An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container
- A population heuristic for constrained two-dimensional non-guillotine cutting
- A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects
- On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
- Solving the pallet loading problem
- An EDA for the 2D knapsack problem with guillotine constraint
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
- The one dimensional Compartmentalised Knapsack problem: a case study
- An integrated cutting stock and sequencing problem
- The pallet loading problem: a review of solution methods and computational experiments
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- The pinwheel pattern and its application to the manufacturer's pallet-loading problem
- scientific article; zbMATH DE number 3958766 (Why is no real title available?)
- Applying genetic algorithms and neural networks to the container loading problem
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
- A heuristic method based on Lagrangean relaxation for a manufacturer's pallet loading problem
- Two-dimensional guillotineable-layout cutting problems with a single defect -- an AND/OR-graph approach
- A fast algorithm for two-dimensional pallet loading problems of large size
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- On the multiple optimal solutions and patterns of the pallet loading problem
- Mathematical models based on decision hypergraphs for designing a storage cabinet
- Classification and literature review of integrated lot-sizing and cutting stock problems
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
This page was built for publication: An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127217)
