A new upper bound for unconstrained two-dimensional cutting and packing
From MaRDI portal
Publication:4656659
DOI10.1057/palgrave/jors/2601326zbMath1059.90122MaRDI QIDQ4656659
Publication date: 14 March 2005
Full work available at URL: https://doi.org/10.1057/palgrave/jors/2601326
90C27: Combinatorial optimization
Related Items
A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects, A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems., Exact algorithms for the two-dimensional guillotine knapsack, Queue-constrained packing: a vehicle ferry case study, The geometry of nesting problems: a tutorial, Simple block patterns for the two-dimensional cutting problem, Generating optimal two-section cutting patterns for rectangular blanks