Generating optimal cutting patterns for rectangular blanks of a single size
From MaRDI portal
Publication:4656759
DOI10.1057/palgrave.jors.2601451zbMath1139.90432MaRDI 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
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
Related Items
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