An and-or-graph approach for two-dimensional cutting problems
From MaRDI portal
Publication:1194741
DOI10.1016/0377-2217(92)90212-RzbMath0757.90071WikidataQ57719589 ScholiaQ57719589MaRDI QIDQ1194741
R. N. Morabito, V. F. Arcaro, Marcos Nereu Arenales
Publication date: 6 October 1992
Published in: European Journal of Operational Research (Search for Journal in Brave)
heuristicsrectangular platecutting stockdepth-firsthill-climbingand-or-graph searchguillotine cutting patterns
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (20)
A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem ⋮ An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock ⋮ An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems ⋮ Exact solutions for constrained two-dimensional cutting problems ⋮ A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation ⋮ Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study ⋮ Approximate algorithms for constrained circular cutting problems ⋮ A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects ⋮ An and-or-graph approach for two-dimensional cutting problems ⋮ Improved state space relaxation for constrained two-dimensional guillotine cutting problems ⋮ Simple block patterns for the two-dimensional cutting problem ⋮ A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems ⋮ SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects ⋮ Solution for the constrained Guillotine cutting problem by simulated annealing ⋮ A recursive exact algorithm for weighted two-dimensional cutting ⋮ Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach ⋮ The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems ⋮ A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
Cites Work
- An and-or-graph approach for two-dimensional cutting problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- Recursive Computational Procedure for Two-dimensional Stock Cutting
This page was built for publication: An and-or-graph approach for two-dimensional cutting problems
