| Current teams : | ACASA ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
| Former team : | Phare |
| Publications RO | 2017 | 2018 | 2019 | 2020 | 2021 | 2022 | 2023 | Total |
|---|---|---|---|---|---|---|---|---|
| Books | 0 | 1 | 2 | 0 | 1 | 0 | 0 | 4 |
| Edited books | 0 | 0 | 0 | 3 | 1 | 0 | 0 | 4 |
| Journal articles | 14 | 15 | 16 | 15 | 19 | 17 | 12 | 108 |
| Book chapters | 0 | 1 | 3 | 0 | 0 | 0 | 0 | 4 |
| Conference papers | 18 | 33 | 48 | 31 | 31 | 38 | 27 | 226 |
| Habilitations | 0 | 1 | 1 | 2 | 0 | 0 | 0 | 4 |
| Theses | 1 | 1 | 0 | 3 | 3 | 2 | 1 | 11 |
- N. Absi, S. Kedad‑Sidhoum : “MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs”, RAIRO - Operations Research, vol. 41 (2), pp. 171-192, (EDP Sciences) [Absi 2007b]
- Ph. Baptiste, P. Brucker, M. Chrobak, Ch. Dürr, S. Kravchenko, F. Sourd : “The Complexity of Mean Flow Time Scheduling Problems with Release Times”, Journal of Scheduling, vol. 10 (2), pp. 139-146, (Springer Verlag) [Baptiste 2007]
- T. Bossart, A. Munier‑Kordon, F. Sourd : “Memory Management Optimization Problems for Integrated Circuit Simulators”, Discrete Applied Mathematics, vol. 155 (14), pp. 1795-1811, (Elsevier) [Bossart 2007]
- N. Faure, Ph. Chrétienne, E. GOURDIN, F. Sourd : “Biclique completion problems for multicast network design”, Discrete Optimization, vol. 4 (3-4), pp. 360-377, (Elsevier) [Faure 2007]
- Y. Hendel, F. Sourd : “An improved earliness-tardiness timing algorithm”, Computers and Operations Research, vol. 34 (10), pp. 2931-2938, (Elsevier) [Hendel 2007]
- M. Liazi, I. Milis, F. Pascual, V. Zissimopoulos : “The k-densest Subgraph Problem in Pairwise Overlapping Cliques”, Journal of Combinatorial Optimization, vol. 14 (4), pp. 465-474, (Springer Verlag) [Liazi 2007]
- F. Sourd : “Scheduling with periodic availability constraints and irregular cost functions”, RAIRO - Operations Research, vol. 41 (2), pp. 141-154, (EDP Sciences) [Sourd 2007]