| Équipes actuelles : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
| Ancienne équipe : | ACASA |
| Publications RO | 2023 | 2024 | Total |
|---|---|---|---|
| Livres | 0 | 0 | 0 |
| Éditions de livres | 0 | 0 | 0 |
| Articles de revues | 15 | 9 | 24 |
| Chapitres de livres | 0 | 0 | 0 |
| Conférences | 34 | 8 | 42 |
| Habilitations | 0 | 0 | 0 |
| Thèses | 2 | 0 | 2 |
- E. Angel, E. Bampis, B. Escoffier, M. Lampis : “Parameterized Power Vertex Cover”, Discrete Mathematics and Theoretical Computer Science, vol. 20 (2), (DMTCS) [Angel 2018]
- S. Angelopoulos, Ch. Dürr, Sh. Kamali, M. Renault, A. Rosén : “Online Bin Packing with Advice of Small Size”, Theory of Computing Systems, vol. 62 (8), pp. 2006-2034, (Springer Verlag) [Angelopoulos 2018b]
- Ch. Artigues, E. Bourreau, V. Jost, S. Kedad‑Sidhoum, F. Ramond : “Trains do not vanish: the ROADEF/EURO challenge 2014”, Annals of Operations Research, vol. 271 (2), pp. 1091-1105, (Springer Verlag) [Artigues 2018]
- E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, M. Sviridenko : “Energy Efficient Scheduling and Routing via Randomized Rounding”, Journal of Scheduling, vol. 21 (1), pp. 35-51, (Springer Verlag) [Bampis 2018a]
- P. Bendotti, P. Fouilhoux, C. Rottner : “The min-up/min-down unit commitment polytope”, Journal of Combinatorial Optimization, vol. 36 (3), pp. 1024-1058, (Springer Verlag) [Bendotti 2018d]
- P. Bendotti, P. Fouilhoux, S. Kedad‑Sidhoum : “The Unit-capacity Constrained Permutation Problem”, European Journal of Operational Research, vol. 268 (2), pp. 463-472, (Elsevier) [Bendotti 2018e]
- É. Bonnet, B. Escoffier, Vangelis Th. Paschos, G. Stamoulis : “Purely combinatorial approximation algorithms for maximum k -vertex cover in bipartite graphs”, Discrete Optimization, vol. 27, pp. 26-56, (Elsevier) [Bonnet 2018]
- Ph. Chrétienne : “Reactive and proactive single-machine scheduling to maintain a maximum number of starting times”, Annals of Operations Research, pp. 1-14, (Springer Verlag) [Chrétienne 2018]
- B. Doerr, C. Doerr : “Optimal Static and Self-Adjusting Parameter Choices for the ( 1 + ( λ , λ ) ) Genetic Algorithm”, Algorithmica, vol. 80, pp. 1658-1709, (Springer Verlag) [Doerr 2018a]
- B. Doerr, C. Doerr, T. Kötzing : “Static and Self-Adjusting Mutation Strengths for Multi-valued Decision Variables”, Algorithmica, vol. 80, pp. 1732-1768, (Springer Verlag) [Doerr 2018c]
- C. Doerr, J. Lengler : “The (1+1) Elitist Black-Box Complexity of LeadingOnes”, Algorithmica, vol. 80, pp. 1579-1603, (Springer Verlag) [Doerr 2018e]
- P. Fouilhoux, A.Ridha Mahjoub, A. Quilliot, H. Toussaint : “Branch-and-Cut-and-Price algorithms for the preemptive RCPSP”, RAIRO - Operations Research, vol. 52 (2), pp. 513-528, (EDP Sciences) [Fouilhoux 2018]
- S. Kedad‑Sidhoum, F. Monna, G. Mounié, D. Trystram : “A Family of Scheduling Algorithms for Hybrid Parallel Platforms”, International Journal of Foundations of Computer Science, vol. 29 (1), pp. 63-90, (World Scientific Publishing) [Kedad-Sidhoum 2018]
- F. Pascual, K. Rzadca : “Colocating tasks in data centers using a side-effects performance model”, European Journal of Operational Research, vol. 268 (2), pp. 450-462, (Elsevier) [Pascual 2018a]
- S.‑L. Phouratsamay, S. Kedad‑Sidhoum, F. Pascual : “Two-level lot-sizing with inventory bounds”, Discrete Optimization, vol. 30, pp. 1-19, (Elsevier) [Phouratsamay 2018]