Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation
RAIRO-Oper. Res., 36 3 (2002) 237-277
Published online: 2003-04-15
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):
Scheduling on parallel machines with preemption and transportation delays
Amina Haned, Ameur Soukhal, Mourad Boudhar and Nguyen Huynh TuongComputers & Operations Research 39 (2) 374 (2012)
https://doi.org/10.1016/j.cor.2011.04.013
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances
Marc Demange and Vangelis PaschosRAIRO - Operations Research 36 (4) 311 (2002)
https://doi.org/10.1051/ro:2003009