Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems
From MaRDI portal
Publication:3401336
DOI10.1111/j.1475-3995.2009.00708.xzbMath1179.90294OpenAlexW2015434556MaRDI QIDQ3401336
Francis J. Vasko, Christopher L. Bartkowski
Publication date: 29 January 2010
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2009.00708.x
Related Items
Heuristic for constrained T-shape cutting patterns of rectangular pieces ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem ⋮ A bidirectional building approach for the 2D constrained guillotine knapsack packing problem ⋮ A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
Cites Work
- Exact solutions for constrained two-dimensional cutting problems
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An improved version of Wang's algorithm for two-dimensional cutting problems
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
