Simple block patterns for the two-dimensional cutting problem

DOI10.1016/J.MCM.2006.09.008MaRDI QIDQ2473240zbMATH OpenOpenAlexFDO

Authors 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

recursive algorithmbranch and boundpackingcutting stockunconstrained two-dimensional cutting

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Recommendations

• Two-stage general block patterns for the two-dimensional cutting problem
• Uniform block patterns for constrained guillotine cutting of rectangular items
• T-shape homogeneous block patterns for the two-dimensional cutting problem
• Generating optimal two-section cutting patterns for rectangular blanks
• An algorithm for the two-dimensional cutting-stock problem based on a pattern generation procedure

Cites work

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

Cited in

(14)

• Solving two-dimensional cutting stock problems with three-block patterns
• Generating optimal cutting patterns for rectangular blanks of a single size
• T-shape homogeneous block patterns for the two-dimensional cutting problem
• Checkerboard pattern: proposals for its generation
• Simplest optimal cutting patterns for equal rectangles
• Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
• Heuristic for constrained T-shape cutting patterns of rectangular pieces
• A recursive algorithm for constrained two-dimensional cutting problems
• Nonorthogonal Two-Dimensional Cutting Patterns
• A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
• Two-stage general block patterns for the two-dimensional cutting problem
• Simplest optimal guillotine cutting patterns for strips of identical circles
• Using layer patterns in solving the two-dimensional cutting stock problem
• Uniform block patterns for constrained guillotine cutting of rectangular items

This page was built for publication: Simple block patterns for the two-dimensional cutting problem

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