Heuristic for constrained T-shape cutting patterns of rectangular pieces
From MaRDI portal
Publication:339642
DOI10.1016/j.cor.2012.03.001zbMath1349.90709OpenAlexW2005857167MaRDI QIDQ339642
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.03.001
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (4)
A block-based layer building approach for the 2D guillotine strip packing problem ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ A bidirectional building approach for the 2D constrained guillotine knapsack packing problem ⋮ Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
Cites Work
- Unnamed Item
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
- Fast heuristic for constrained homogenous T-shape cutting patterns
- An exact algorithm for generating homogeneous T-shape cutting patterns
- Two-stage general block patterns for the two-dimensional cutting problem
- 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
- Cutting stock problems and solution procedures
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- Efficient Algorithm for the Constrained Two‐dimensional Cutting Stock Problem
- Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem
- Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
This page was built for publication: Heuristic for constrained T-shape cutting patterns of rectangular pieces
