A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting

DOI10.1016/j.ejor.2009.05.047zbMath1175.90405WikidataQ57185717 ScholiaQ57185717MaRDI QIDQ1039779

J. Blot

Publication date: 23 November 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.05.047

zbMATH Keywords

dynamic programming; heuristic; 2D cutting

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C39: Dynamic programming