الوحدات الحالية : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
الفـرق السـابـقــة : | ACASA |
إصدارات RO | 2023 | 2024 | Total |
---|---|---|---|
كتـب | 0 | 0 | 0 |
إصدار كـتب | 0 | 0 | 0 |
مـنشـورات في مـجلات | 15 | 3 | 18 |
فصـول في كـتب | 0 | 0 | 0 |
منشورات | 30 | 1 | 31 |
تراخيص | 0 | 0 | 0 |
مـذكرات | 2 | 0 | 2 |
- G. Dequen, O. Dubois : “An efficient approach to solving random k-SAT problems”, Journal of Automated Reasoning, vol. 37 (4), pp. 261-276, (Springer Verlag) [Dequen 2006]
- P. Fouilhoux, A. Ridha Mahjoub : “Polyhedral results for the bipartite induced subgraph problem”, Discrete Applied Mathematics, vol. 154 (15), pp. 2128-2149, (Elsevier) [Fouilhoux 2006a]
- B. Gaujal, E. Hyon, A. Jean‑Marie : “Optimal routing in two parallel Queues with Exponential service times”, Discrete Event Dynamic Systems, vol. 16 (1), pp. 71-107, (Springer Verlag) [Gaujal 2006]
- Y. Hendel, F. Sourd : “Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem”, European Journal of Operational Research, vol. 173 (1), pp. 108-119, (Elsevier) [Hendel 2006]
- F. Sourd : “Dynasearch neighborhood for the earliness-tardiness scheduling problem with release dates and setup constraints”, Operations Research Letters, vol. 34 (5), pp. 591-598, (Elsevier) [Sourd 2006b]
- F. Sourd : “Preemptive scheduling with position costs”, Algorithmic Operations Research, vol. 1 (2), pp. 79-93, (Preeminent Academic Facets) [Sourd 2006c]