Simple block patterns for the two-dimensional cutting problem

DOI10.1016/j.mcm.2006.09.008zbMath1171.90506MaRDI QIDQ2473240

Yaodong Cui

Publication date: 26 February 2008

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2006.09.008

zbMATH Keywords

branch and bound; packing; recursive algorithm; cutting stock; unconstrained two-dimensional cutting

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C27: Combinatorial optimization

Related Items

A recursive algorithm for constrained two-dimensional cutting problems, A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting

Cites Work

• An approximation algorithm for solving unconstrained two-dimensional knapsack problems
• An and-or-graph approach for two-dimensional cutting problems
• A recursive exact algorithm for weighted two-dimensional cutting
• A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
• Generating optimal two-section cutting patterns for rectangular blanks
• Efficient Algorithm for the Constrained Two‐dimensional Cutting Stock Problem
• An efficient approach for large-scale two-dimensional guillotine cutting stock problems
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• A new upper bound for unconstrained two-dimensional cutting and packing
• An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
• Multistage Cutting Stock Problems of Two and More Dimensions
• Recursive Computational Procedure for Two-dimensional Stock Cutting
• Exact algorithms for large-scale unconstrained two and three staged cutting problems
• A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems