An exact algorithm for generating homogeneous T-shape cutting patterns

DOI10.1016/j.cor.2005.05.025zbMath1102.90045OpenAlexW2079379402MaRDI QIDQ856687

Yaodong Cui

Publication date: 7 December 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.05.025

zbMATH Keywords

packingcuttingcutting stockconstrained two-dimensional cutting

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (6)

Heuristic for constrained T-shape cutting patterns of rectangular pieces ⋮ An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem ⋮ Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem ⋮ A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns ⋮ Fast heuristic for constrained homogenous T-shape cutting patterns ⋮ A recursive algorithm for constrained two-dimensional cutting problems

Cites Work

• Unnamed Item
• Unnamed Item
• Exact solutions for constrained two-dimensional cutting problems
• An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
• Integer linear programming models for 2-staged two-dimensional knapsack problems
• Unbounded knapsack problem: Dynamic programming revisited
• Efficient Algorithm for the Constrained Two‐dimensional Cutting Stock Problem
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
• An Algorithm for Two-Dimensional Cutting Problems
• Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
• An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
• Exact algorithms for large-scale unconstrained two and three staged cutting problems
• Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems

This page was built for publication: An exact algorithm for generating homogeneous T-shape cutting patterns