Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm

DOI10.1057/palgrave.jors.2600364zbMath0890.90157OpenAlexW1976159629MaRDI QIDQ4367021

Mhand Hifi, Vassilios Zissimopoulos

Publication date: 25 November 1997

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.2600364

zbMATH Keywords

lower and upper boundsbottom-up algorithmconstrained two-dimensional cuttingbranching strategy

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (8)

An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem ⋮ A bidirectional building approach for the 2D constrained guillotine knapsack packing problem ⋮ A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems ⋮ The maximum diversity assortment selection problem ⋮ A recursive algorithm for constrained two-dimensional cutting problems ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems

This page was built for publication: Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm