A recursive algorithm for constrained two-dimensional cutting problems
From MaRDI portal
Publication:1029631
DOI10.1007/s10589-007-9103-3zbMath1169.90429OpenAlexW2162080865MaRDI QIDQ1029631
Publication date: 13 July 2009
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9103-3
Related Items
A block-based layer building approach for the 2D guillotine strip packing problem ⋮ An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem ⋮ An EDA for the 2D knapsack problem with guillotine constraint ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming ⋮ Improved state space relaxation for constrained two-dimensional guillotine cutting problems ⋮ Exact algorithms for the two-dimensional guillotine knapsack ⋮ A bidirectional building approach for the 2D constrained guillotine knapsack packing problem ⋮ Strip based compact formulation for two-dimensional guillotine cutting problems
Cites Work
- Unnamed Item
- An exact algorithm for generating homogeneous T-shape cutting patterns
- Exact solutions for constrained two-dimensional cutting problems
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- Simple block patterns for the two-dimensional cutting problem
- An improved typology of cutting and packing problems
- Efficient Algorithm for the Constrained Two‐dimensional Cutting Stock Problem
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
- Exact algorithms for large-scale unconstrained two and three staged cutting problems
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
