Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
From MaRDI portal
Publication:4367021
DOI10.1057/palgrave.jors.2600364zbMath0890.90157MaRDI 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
lower and upper bounds; bottom-up algorithm; constrained two-dimensional cutting; branching strategy
Related Items
A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems, 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 recursive algorithm for constrained two-dimensional cutting problems, New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems, The maximum diversity assortment selection problem