An exact algorithm for generating homogeneous T-shape cutting patterns
From MaRDI portal
Publication:856687
DOI10.1016/J.COR.2005.05.025zbMATH Open1102.90045OpenAlexW2079379402MaRDI QIDQ856687FDOQ856687
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
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Dynamic programming (90C39)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- An Algorithm for Two-Dimensional Cutting Problems
- Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
- Unbounded knapsack problem: Dynamic programming revisited
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- Efficient algorithm for the constrained two-dimensional cutting stock problem
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Exact algorithms for large-scale unconstrained two and three staged cutting problems
- An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
- Exact solutions for constrained two-dimensional cutting problems
Cited In (12)
- An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
- Exact algorithm for generating two-segment cutting patterns of punched strips
- T-shape homogeneous block patterns for the two-dimensional cutting problem
- Heuristic for constrained T-shape cutting patterns of rectangular pieces
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
- Fast heuristic for constrained homogenous T-shape cutting patterns
- A cutting stock problem and its solution in the manufacturing industry of large electric generators
- A recursive algorithm for constrained two-dimensional cutting problems
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
- An algorithm for the determination of optimal cutting patterns
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- An enumeration scheme to generate constrained exact checkerboard 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)
