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

DOI10.1007/S10898-007-9252-ZzbMath1145.90041OpenAlexW2033165331MaRDI QIDQ933804

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)

Related Items (1)

An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems

Cites Work

• Unnamed Item
• Minimizing trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts
• Two-stage general block patterns for the two-dimensional cutting problem
• A recursive exact algorithm for weighted two-dimensional cutting
• A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
• Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles
• Dynamic programming algorithms for the optimal cutting of equal rectangles
• 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
• Generating optimal cutting patterns for rectangular blanks of a single size
• A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem
• 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: T-shape homogeneous block patterns for the two-dimensional cutting problem