Fast heuristic for constrained homogenous T-shape cutting patterns
From MaRDI portal
Publication:693480
DOI10.1016/j.apm.2011.11.005zbMath1252.90091OpenAlexW2042395469MaRDI QIDQ693480
Publication date: 7 December 2012
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2011.11.005
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A block-based layer building approach for the 2D guillotine strip packing problem ⋮ Heuristic for constrained T-shape cutting patterns of rectangular pieces ⋮ An open space based heuristic for the 2D strip packing problem with unloading constraints
Cites Work
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
- An exact algorithm for generating homogeneous T-shape cutting patterns
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- On the two-dimensional knapsack problem
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- Efficient Algorithm for the Constrained Two‐dimensional Cutting Stock Problem
- GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- Exact algorithms for large-scale unconstrained two and three staged cutting problems
