Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems

DOI10.1111/J.1475-3995.2009.00708.XMaRDI QIDQ3401336zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

two-dimensional guillotine cutting stock problemWang's algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Efficient algorithm for the constrained two-dimensional cutting stock problem
• An improved version of Wang's algorithm for two-dimensional cutting problems
• A near-optimal solution to a two-dimensional cutting stock problem
• The two-dimensional cutting stock problem revisited
• An approach to two-dimensional cutting stock problems
• An algorithm for the 2D guillotine cutting stock problem
• A Two-phase Heuristic for the Two-dimensional Cutting-stock Problem
• An efficient approach for large-scale two-dimensional guillotine cutting stock problems
• Algorithms for the one-dimensional two-stage cutting stock problem

Cites work

• An efficient approach for large-scale two-dimensional guillotine cutting stock problems
• 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 improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
• Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
• Exact solutions for constrained two-dimensional cutting problems
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems

Cited in

(8)

• An improved version of Wang's algorithm for two-dimensional cutting problems
• A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement 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
• scientific article; zbMATH DE number 764408 (Why is no real title available?)
• Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
• EATKG: an open-source efficient \underline{E}xact \underline{A}lgorithm for the \underline{T}wo-dimensional \underline{K}napsack problem with \underline{G}uillotine constraints
• A bidirectional building approach for the 2D constrained guillotine knapsack packing problem

This page was built for publication: Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems

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