Generating optimal cutting patterns for rectangular blanks of a single size

DOI10.1057/PALGRAVE.JORS.2601451zbMath1139.90432OpenAlexW2008493041MaRDI QIDQ4656759

No author found.

Publication date: 14 March 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601451

zbMATH Keywords

optimizationmanufacturingpackingcutting stock problempallet loading problem

Mathematics Subject Classification ID

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

Related Items (4)

Simplest optimal cutting patterns for equal rectangles ⋮ T-shape homogeneous block patterns for the two-dimensional cutting problem ⋮ Dynamic programming algorithms for the optimal cutting of equal rectangles ⋮ Dynamic programming algorithms for generating optimal strip layouts

This page was built for publication: Generating optimal cutting patterns for rectangular blanks of a single size