| Équipes actuelles : | ACASA ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
| Ancienne équipe : | Phare |
| Publications RO | 2017 | 2018 | 2019 | 2020 | 2021 | 2022 | 2023 | Total |
|---|---|---|---|---|---|---|---|---|
| Livres | 0 | 1 | 2 | 0 | 1 | 0 | 0 | 4 |
| Éditions de livres | 0 | 0 | 0 | 3 | 1 | 0 | 0 | 4 |
| Articles de revues | 14 | 15 | 16 | 15 | 19 | 17 | 12 | 108 |
| Chapitres de livres | 0 | 1 | 3 | 0 | 0 | 0 | 0 | 4 |
| Conférences | 18 | 33 | 48 | 31 | 31 | 38 | 27 | 226 |
| Habilitations | 0 | 1 | 1 | 2 | 0 | 0 | 0 | 4 |
| Thèses | 1 | 1 | 0 | 3 | 3 | 2 | 1 | 11 |
- N. Absi, S. Kedad‑Sidhoum : “The multi-item capacitated lot-sizing problem with setup times and shortage costs”, European Journal of Operational Research, vol. 185 (3), pp. 1351-1374, (Elsevier) [Absi 2008c]
- E. Angel, E. Bampis, F. Pascual : “An exponential (matching based) neighborhood for the vehicle routing problem”, Journal of Combinatorial Optimization, vol. 15 (2), pp. 179-190, (Springer Verlag) [Angel 2008a]
- E. Angel, E. Bampis, F. Pascual : “How good are SPT schedules for fair optimality criteria”, Annals of Operations Research, vol. 159 (1), pp. 53-64, (Springer Verlag) [Angel 2008b]
- E. Angel, E. Bampis, F. Pascual : “The impact of local policies on the quality of packet routing in paths, trees, and rings”, Journal of Scheduling, vol. 11 (5), pp. 311-322, (Springer Verlag) [Angel 2008c]
- Ph. Baptiste, M. Flamini, F. Sourd : “Lagrangian bounds for just-in-time job-shop scheduling”, Computers and Operations Research, vol. 35 (3), pp. 906-915, (Elsevier) [Baptiste 2008]
- Ph. Chrétienne : “On single-machine scheduling without intermediate delays”, Discrete Applied Mathematics, vol. 156 (13), pp. 2543-2550, (Elsevier) [Chrétienne 2008]
- P. Fouilhoux : “L'optimisation Combinatoire”, Pour la science, vol. 369, pp. 50-56, (Pour la Science) [Fouilhoux 2008a]
- Y. Hendel, F. Sourd : “Job-shop with two jobs and irregular criteria”, International Journal of Operations Research, vol. 5 (1), pp. 61-67, (Operations Research Society of Taiwan (ORSTW)) [Hendel 2008]
- S. Kedad‑Sidhoum, Y. Rios Solis, F. Sourd : “Lower bound for the earliness-tardiness scheduling problem on parallel machines with distinct due dates”, European Journal of Operational Research, vol. 189 (3), pp. 1305-1316, (Elsevier) [Kedad-Sidhoum 2008c]
- E. Neron, F. Tercinet, F. Sourd : “Search tree based approaches for parallel machine scheduling”, Computers and Operations Research, vol. 35 (4), pp. 1127-1137, (Elsevier) [Neron 2008]
- Y. Rios Solis, F. Sourd : “Exponential neighborhood search for a parallel machine scheduling problem”, Computers and Operations Research, vol. 35 (5), pp. 1697-1712, (Elsevier) [Rios Solis 2008]
- F. Sourd, O. Spanjaard : “A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem”, INFORMS Journal on Computing, vol. 20 (3), pp. 472-484, (Institute for Operations Research and the Management Sciences (INFORMS)) [Sourd 2008a]
- F. Sourd, S. Kedad‑Sidhoum : “A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem”, Journal of Scheduling, vol. 11 (1), pp. 49-58, (Springer Verlag) [Sourd 2008b]
- B. Vatinlen, F. Chauvet, Ph. Chrétienne, Ph. Mahey : “Simple Bounds and Greedy Algorithms for Decomposing a Flow into a Minimal Set of Paths”, European Journal of Operational Research, vol. 185 (3), pp. 1390-1401, (Elsevier) [Vatinlen 2008]