| Nhóm nghiên cứu hiện hành : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
| Đội cũ : | ACASA |
| Bài báo khoa học RO | 2023 | 2024 | Total |
|---|---|---|---|
| Sách | 0 | 0 | 0 |
| Soạn thảo sách | 0 | 0 | 0 |
| Bài báo khoa học | 15 | 4 | 19 |
| Chương sách | 0 | 0 | 0 |
| Bài hội thảo khoa học | 30 | 1 | 31 |
| Habilitations | 0 | 0 | 0 |
| Thesis | 2 | 0 | 2 |
- S. Angelopoulos, A. Borodin : “Randomized priority algorithms”, Theoretical Computer Science, vol. 411 (26-28), pp. 2542-2558, (Elsevier) [Angelopoulos 2010]
- Th. Begin, B. Baynat, F. Sourd, A. Brandwajn : “A DFO technique to calibrate queueing models”, Computers and Operations Research, vol. 37 (2), pp. 273-281, (Elsevier) [Begin 2010b]
- A. Benabid, C. Hanen : “Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors.”, Electronic Notes in Discrete Mathematics, vol. 36 (1), pp. 791-798, (Elsevier) [Benabid 2010b]
- A. Benabid, C. Hanen : “Performance of Garey Johnson algorithm for pipelined type tasks systems”, International Transactions in Operational Research, vol. 17 (6), pp. 797-808, (Wiley) [Benabid 2010c]
- F. Diedrich, K. Jansen, F. Pascual, D. Trystram : “Approximation algorithms for scheduling with reservations”, Algorithmica, vol. 58 (2), pp. 391-404, (Springer Verlag) [Diedrich 2010]
- O. Hazir, M. Haouari, E. Erel : “Discrete time/cost trade-off problem: A decomposition based solution algorithm for the budget version”, Computers and Operations Research, vol. 37 (4), pp. 649-655, (Elsevier) [Hazir 2010a]
- S. Kedad‑Sidhoum, F. Sourd : “Fast Neighborhood Search For The Single Machine Earliness-Tardiness Scheduling Problem”, Computers and Operations Research, vol. 37 (8), pp. 1464-1471, (Elsevier) [Kedad-Sidhoum 2010b]
- S. Kedad‑Sidhoum, V. Nguyen : “An Exact Algorithm for Solving the Ring Star Problem”, Optimization, vol. 59 (1), pp. 125-140, (Taylor & Francis) [Kedad-Sidhoum 2010c]
- F. Sourd : “Lexicographically minimizing axial motions for the Euclidean TSP”, Journal of Combinatorial Optimization, vol. 19 (1), pp. 1-15, (Springer Verlag) [Sourd 2010]