An exact algorithm for generating homogeneous T-shape cutting patterns

DOI10.1016/J.COR.2005.05.025MaRDI QIDQ856687zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• T-shape homogeneous block patterns for the two-dimensional cutting problem
• A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
• Fast heuristic for constrained homogenous T-shape cutting patterns
• Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
• Generating optimal two-section cutting patterns for rectangular blanks

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• An Algorithm for Two-Dimensional Cutting Problems
• An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
• An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
• Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
• Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
• Efficient algorithm for the constrained two-dimensional cutting stock problem
• Exact algorithms for large-scale unconstrained two and three staged cutting problems
• Exact solutions for constrained two-dimensional cutting problems
• Integer linear programming models for 2-staged two-dimensional knapsack problems
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
• Unbounded knapsack problem: Dynamic programming revisited

Cited in

(12)

• A cutting stock problem and its solution in the manufacturing industry of large electric generators
• An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
• Heuristic for constrained T-shape cutting patterns of rectangular pieces
• An enumeration scheme to generate constrained exact checkerboard patterns
• T-shape homogeneous block patterns for the two-dimensional cutting problem
• An algorithm for the determination of optimal cutting patterns
• Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
• Fast heuristic for constrained homogenous T-shape cutting patterns
• A recursive algorithm for constrained two-dimensional cutting problems
• Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
• Exact algorithm for generating two-segment cutting patterns of punched strips
• A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856687)