A new upper bound for unconstrained two-dimensional cutting and packing

DOI10.1057/palgrave/jors/2601326zbMath1059.90122OpenAlexW4243036005MaRDI QIDQ4656659

Maing-Kyu Kang, Young-Gun G

Publication date: 14 March 2005

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

zbMATH Keywords

upper boundoptimisationcutting stock problemtwo-dimensional packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (9)

The geometry of nesting problems: a tutorial ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ Exact approaches for the unconstrained two-dimensional cutting problem with defects ⋮ A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems. ⋮ A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects ⋮ Simple block patterns for the two-dimensional cutting problem ⋮ Exact algorithms for the two-dimensional guillotine knapsack ⋮ Queue-constrained packing: a vehicle ferry case study ⋮ Generating optimal two-section cutting patterns for rectangular blanks

This page was built for publication: A new upper bound for unconstrained two-dimensional cutting and packing