| 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 DECISION | 2017 | 2018 | 2019 | 2020 | 2021 | 2022 | 2023 | Total |
|---|---|---|---|---|---|---|---|---|
| Books | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 |
| Edited books | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |
| Journal articles | 16 | 10 | 6 | 6 | 7 | 5 | 1 | 51 |
| Book chapters | 1 | 0 | 0 | 3 | 0 | 3 | 0 | 7 |
| Conference papers | 15 | 11 | 19 | 22 | 16 | 11 | 7 | 101 |
| Habilitations | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| Theses | 4 | 1 | 0 | 1 | 1 | 4 | 1 | 12 |
- H. Agli, Ph. Bonnard, Ch. Gonzales, P.‑H. Wuillemin : “Inférence incrémentale pour les modèles probabilistes relationnels et application aux systèmes à base de règles orientés objet”, Revue des Sciences et Technologies de l'Information - Série RIA : Revue d'Intelligence Artificielle, vol. 32 (1), Réseaux bayésiens et modèles probabilistes, pp. 111-132, (Lavoisier) [Agli 2018]
- N. Benabbou, P. Perny : “Interactive resolution of multiobjective combinatorial optimization problems by incremental elicitation of criteria weights”, EURO journal on decision processes, (Springer) [Benabbou 2018c]
- C. Butz, A. Dos Santos, Jh. Oliveira, Ch. Gonzales : “On a simple method for testing independencies in Bayesian networks”, Computational Intelligence, vol. 34 (3), pp. 789-801, (Wiley) [Butz 2018]
- L. Costa, Th. Lust, R. Kramer, A. Subramanian : “A two-phase Pareto local search heuristic for the bi-objective pollution-routing problem”, Networks, vol. 72 (3), pp. 311-336, (Wiley) [Costa 2018]
- R. Costa Dias, L. Santos, H. Ouzia, R. Schledjewski : “Improving degree of cure in pultrusion process by optimizing die-temperature”, Materials Today Communications, vol. 17, pp. 362-370, (Elsevier) [Costa Dias 2018]
- Ch. Gonzales : “Les réseaux bayésiens”, Interstices, (INRIA) [Gonzales 2018]
- M. Hourbracq, P.‑H. Wuillemin, Ch. Gonzales, Ph. Baumard : “Apprentissage et sélection de réseaux bayésiens dynamiques pour les processus online non stationnaires”, Revue des Sciences et Technologies de l'Information - Série RIA : Revue d'Intelligence Artificielle, vol. 32 (1), Réseaux bayésiens et modèles probabilistes, pp. pp.75-109, (Lavoisier) [Hourbracq 2018]
- A. Jaszkiewicz, Th. Lust : “ND-Tree-Based Update: A Fast Algorithm for the Dynamic Nondominance Problem”, IEEE Transactions on Evolutionary Computation, vol. 22 (5), pp. 778-791, (Institute of Electrical and Electronics Engineers) [Jaszkiewicz 2018b]
- O. Khaled, V. Mousseau, M. Minoux, X. Ceugniet, M. Stéphane : “A compact optimization model for the tail assignment problem”, European Journal of Operational Research, vol. 264 (2), pp. 548-557, (Elsevier) [Khaled 2018]
- J. Lesca, M. Minoux, P. Perny : “The Fair OWA One-to-one Assignment Problem: NP-hardness and Polynomial Time Special Cases.”, Algorithmica, (Springer Verlag) [Lesca 2018]