Generating optimal two-section cutting patterns for rectangular blanks

DOI10.1016/j.cor.2004.09.022zbMath1091.90061OpenAlexW1988670902MaRDI QIDQ2581593

Yaodong Cui, Dongli He, Xiaoxia Song

Publication date: 10 January 2006

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

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

zbMATH Keywords

OptimizationCutting stock problemTwo-dimensional cuttingGuillotine

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Two-stage general block patterns for the two-dimensional cutting problem ⋮ A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns ⋮ T-shape homogeneous block patterns for the two-dimensional cutting problem ⋮ Simple block patterns for the two-dimensional cutting problem

Uses Software

• OR-Library

Cites Work

• 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
• Unbounded knapsack problem: Dynamic programming revisited
• LP models for bin packing and cutting stock problems
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• An Algorithm for Two-Dimensional Cutting Problems
• A new upper bound for unconstrained two-dimensional cutting and packing
• Multistage Cutting Stock Problems of Two and More Dimensions
• The Theory and Computation of Knapsack Functions
• Recursive Computational Procedure for Two-dimensional Stock Cutting
• Exact algorithms for large-scale unconstrained two and three staged cutting problems