Une amélioration de l'algorithme récursif de Herz pour le problème de découpe à deux dimensions
RAIRO-Oper. Res., 30 2 (1996) 111-125
Published online: 2017-02-10
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
Lijun Wei, Qian Hu, Andrew Lim and Qiang LiuEuropean Journal of Operational Research 270 (2) 448 (2018)
https://doi.org/10.1016/j.ejor.2018.04.014
Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm
E G Birgin, R D Lobato and R MorabitoJournal of the Operational Research Society 63 (2) 183 (2012)
https://doi.org/10.1057/jors.2011.6
A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
Ramón Alvarez-Valdés, Antonio Parajón and Jose’e Manuel TamaritComputers & Operations Research 29 (7) 925 (2002)
https://doi.org/10.1016/S0305-0548(00)00095-2