Two-stage general block patterns for the two-dimensional cutting problem

DOI10.1016/J.COR.2005.11.002zbMath1185.90171OpenAlexW2038793924MaRDI QIDQ878556

Yaodong Cui, Xianquan Zhang

Publication date: 26 April 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.11.002

zbMATH Keywords

dynamic programmingcutting stockunconstrained two-dimensional cutting

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (6)

Exact algorithm for generating two-segment cutting patterns of punched strips ⋮ Sequential heuristic for the two-dimensional bin-packing problem ⋮ Heuristic for constrained T-shape cutting patterns of rectangular pieces ⋮ T-shape homogeneous block patterns for the two-dimensional cutting problem ⋮ A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting ⋮ Unnamed Item

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• An approximation algorithm for solving unconstrained two-dimensional knapsack problems
• A recursive exact algorithm for weighted two-dimensional cutting
• The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
• A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
• Generating optimal two-section cutting patterns for rectangular blanks
• An efficient approach for large-scale two-dimensional guillotine cutting stock problems
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• Multistage Cutting Stock Problems of Two and More Dimensions
• 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

This page was built for publication: Two-stage general block patterns for the two-dimensional cutting problem