Une amélioration de l'algorithme récursif de Herz pour le problème de découpe à deux dimensions

DOI10.1051/ro/1996300201111zbMath0859.90107OpenAlexW2518911661MaRDI QIDQ5689727

Mhand Hifi, Vassilios Zissimopoulos

Publication date: 10 April 1997

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105123

zbMATH Keywords

recursive algorithmknapsacktwo-dimensional cutting stock

Mathematics Subject Classification ID

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

Related Items

A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem, A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems, A recursive exact algorithm for weighted two-dimensional cutting