T-shape homogeneous block patterns for the two-dimensional cutting problem

DOI10.1007/S10898-007-9252-ZMaRDI QIDQ933804zbMATH OpenOpenAlexFDO

Authors Yaodong Cui, Zhi-Yong Liu

Publication date 25 July 2008

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-007-9252-z

zbMATH Keywords

Cutting stockHomogenous blocksUnconstrained two-dimensional cutting

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• Simple block patterns for the two-dimensional cutting problem
• An exact algorithm for generating homogeneous T-shape cutting patterns
• Two-stage general block patterns for the two-dimensional cutting problem
• A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
• Fast heuristic for constrained homogenous T-shape cutting patterns
• Heuristic for constrained T-shape cutting patterns of rectangular pieces
• Solving two-dimensional cutting stock problems with three-block patterns
• Uniform block patterns for constrained guillotine cutting of rectangular items
• Generating optimal T-shape cutting patterns for circular blanks
• Generating optimal two-section cutting patterns for rectangular blanks

Cites work

• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem
• A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
• 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 efficient approach for large-scale two-dimensional guillotine cutting stock problems
• Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles
• Dynamic programming algorithms for the optimal cutting of equal rectangles
• Exact algorithms for large-scale unconstrained two and three staged cutting problems
• Generating optimal cutting patterns for rectangular blanks of a single size
• Generating optimal two-section cutting patterns for rectangular blanks
• Minimizing trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts
• Multistage Cutting Stock Problems of Two and More Dimensions
• Two-stage general block patterns for the two-dimensional cutting problem

Cited in

(9)

• Simple block patterns for the two-dimensional cutting problem
• An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
• Heuristic for constrained T-shape cutting patterns of rectangular pieces
• Fast heuristic for constrained homogenous T-shape cutting patterns
• An algorithm for the constrained two-dimensional rectangular multiple identical large object placement problem
• A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
• An exact algorithm for generating homogeneous T-shape cutting patterns
• Two-stage general block patterns for the two-dimensional cutting problem
• Uniform block patterns for constrained guillotine cutting of rectangular items

This page was built for publication: T-shape homogeneous 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 Q933804)