An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock Problem
From MaRDI portal
Publication:3468863
DOI10.1057/jors.1990.22zbMath0693.90043OpenAlexW2008183035MaRDI QIDQ3468863
Parviz Ghandforoush, John J. Daniels
Publication date: 1990
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1990.22
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Production models (90B30) Combinatorial optimization (90C27)
Related Items (6)
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem ⋮ An exact algorithm for general, orthogonal, two-dimensional knapsack problems ⋮ Packing problems ⋮ The pallet loading problem: a review of solution methods and computational experiments ⋮ A simulated annealing heuristic for the one-dimensional cutting stock problem ⋮ An exact depth-first algorithm for the pallet loading problem
This page was built for publication: An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock Problem
