Heuristic for constrained T-shape cutting patterns of rectangular pieces
From MaRDI portal
Publication:339642
DOI10.1016/J.COR.2012.03.001zbMATH Open1349.90709OpenAlexW2005857167MaRDI QIDQ339642FDOQ339642
Authors: Yaodong Cui, Baixiong Huang 
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
Recommendations
- Fast heuristic for constrained homogenous T-shape cutting patterns
- T-shape homogeneous block patterns for the two-dimensional 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
- Simple block patterns for the two-dimensional cutting problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Cutting stock problems and solution procedures
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Fast heuristic for constrained homogenous T-shape cutting patterns
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- Efficient algorithm for the constrained two-dimensional cutting stock problem
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- 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
- Algorithms for the constrained two-staged two-dimensional cutting problem
- Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems
- An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
- A recursive branch-and-bound algorithm for constrained homogeneous 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
Cited In (8)
- T-shape homogeneous block patterns for the two-dimensional cutting problem
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- A block-based layer building approach for the 2D guillotine strip packing problem
- Fast heuristic for constrained homogenous T-shape cutting patterns
- An algorithm for the constrained two-dimensional rectangular multiple identical large object placement problem
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
- Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
This page was built for publication: Heuristic for constrained T-shape cutting patterns of rectangular pieces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339642)
