Zacharie Alès
I am currently an associate professor at ENSTA in the UMA laboratory. I am also in the OC team of the CEDRIC laboratory. From 2015 to 2017 I was an associate professor at the University of Avignon in the team Operational Research and Optimisation of the LIA laboratory. I obtained my PhD in 2014 from INSA de Rouen in the LMI and LITIS laboratories under the supervision of Christian Gout, Laurent Vercouter, Arnaud Knippel and Alexandre Pauchet. The aim of my thesis (available here in french) was to extract regularities in two-dimensional dialogue annotations. To this end we developped a two-step methodology in which recurrent patterns are first extracted (using approaches based on bioinformatic algorithms) and then clustered (either thanks to heuristics or by solving a mixed integer program). The methods have been implemented in a decision aid software called VIESA. Research interests ο Combinatorial optimisation ο Mathematical programming ο Data science ο Polyhedral approach ο Robust optimisation ο Clustering and scheduling problems ο Data mining
2024
Articles de revue
- New optimization models for optimal classification trees. In Computers and Operations Research, 164: 106515, 2024. doi www
Non publié
- Clustering data for the Optimal Classication Tree Problem. , working paper or preprint. www
2023
Articles de revue
- Robust MILP formulations for the two-stage weighted vertex p -center problem. In Computers and Operations Research: 106334, 2023. doi www
Thèses et habilitations
- Contributions `a la résolution de problèmes d'optimisation combinatoire difficiles. Ph.D. Thesis, IPParis, 2023.
Non publié
- Correlation Clustering Problem under Mediation. , working paper or preprint. www
2022
Articles de revue
- Minimizing recovery cost of network optimization problems. In Networks, 2022. doi www
- An efficient Benders decomposition for the p-median problem. In European Journal of Operational Research, 2022. doi www
Articles de conférence
- Robust MILP formulations for the two-stage p-Center Problem. In PGMO Days 2022, Palaiseau, France, 2022. www
- Modélisations d'arbres de décision optimaux. In 23ème congrès annuel de la société Franc caise de Recherche Opérationnelle et d'Aide `a la Décision (ROADEF 22), Lyon, France, 2022. www
- Algorithmes de placement optimisé de drones pour la conception de réseaux de communication. In Conference on Artificial Intelligence for Defense (CAID) 2022, Rennes, France, Actes de la 4ème Conference on Artificial Intelligence for Defense (CAID 2022) , 2022. www
- An efficient Benders decomposition for the p-median problem. In 23ème congrès annuel de la Société Franc caise de Recherche Opérationnelle et d'Aide `a la Décision, Villeurbanne - Lyon, France, 2022. www
- Construction d'arbres de décision optimaux. In 23ème congrès annuel de la Société Franc caise de Recherche Opérationnelle et d'Aide `a la Décision, Villeurbanne - Lyon, France, 2022. www
- Planification optimisée du déploiement d'un réseau de télécommunication multitechnologie par dispositifs aéroportés sur un théâtre d'opérations extérieures. In 23ème congrès annuel de la Société Franc caise de Recherche Opérationnelle et d'Aide `a la Décision, Villeurbanne - Lyon, France, 2022. www
- New optimization models for optimal classification trees. In 32nd European Conference on Operational Research (EURO 2022), Espoo, Finland, 2022. www
- AutoExpe.jl : Ne coder que les méthodes de résolution. In 23ème congrès annuel de la Société Franc caise de Recherche Opérationnelle et d'Aide `a la Décision, Villeurbanne - Lyon, France, 2022. www
Non publié
- Robust MILP formulations for the two-stage weighted vertex p-center problem. , working paper or preprint. www
Logiciel
2021
Articles de revue
- Multi-objective optimization for VM placement in homogeneous and heterogeneous cloud service provider data centers. In Computing, 103 (6): 1255-1279, 2021. doi www
Articles de conférence
- On learning node selection in a branch and bound algorithm. In Conférence ROADEF 2021, Mulhouse, France, 2021. www
2020
Articles de revue
- The K-partitioning problem: Formulations and branch-and-cut. In Networks, 76 (3): 323-349, 2020. doi www
Chapitres d'ouvrage
- Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research. CPAIOR: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pages 176-185, 2020. doi www
Articles de conférence
- Problème de Correlation Clustering avec Médiateurs. In Conférence ROADEF 2020, Montpellier, France, 2020. www
2019
Articles de conférence
- Réduction des co^uts d'adaptation d'un plan de transport ferroviaire `a l'aide de solutions adaptative. In Conférence ROADEF 2019, Le Havre, France, 2019. www
- Reducing the Adaptation Costs of a Rolling Stock Schedule with Adaptive Solution: the Case of Demand Changes. In RailNorrk"oping 2019. 8th International Conference on Railway Operations Modelling and Analysis (ICROMA), pages 857-876, Norrk"oping, Sweden, Link"oping Electronic Conference Proceedings 69, 2019. www
- A Graph-based Heuristic for Variable Selection in Mixed Integer Linear Programming. In PGMO Days, Paris, France, 2019. www
2018
Articles de revue
- Minimizing the weighted sum of completion times under processing time uncertainty. In Electronic Notes in Discrete Mathematics, 64: 15-24, 2018. doi www
- Extraction and Clustering of Two-Dimensional Dialogue Patterns. In International Journal on Artificial Intelligence Tools, 27 (02): 1850001, 2018. doi www
Chapitres d'ouvrage
- Compact MILP formulations for the p-center problem. In Combinatorial Optimization, pages 14-25, Springer, Lecture Notes in Computer Science 10856, 2018. doi www
Articles de conférence
- Comparaison de formulations pour le problème du p-centre. In Conférence ROADEF 2018, Lorient, France, 2018. www
- A MILP Formulation for Adaptive Solutions in Railway Scheduling. In PGMO Days 2018, Palaiseau, France, 2018. www
- Compact MILP formulations for the p-center problem. In ISCO (International Symposium on Combinatorial Optimization) 2018, Marrakesh, France, 2018. www
2017
Articles de revue
- Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties. In Computers and Operations Research, 81: 203-215, 2017. doi www
2016
Articles de revue
- Polyhedral combinatorics of the K-partitioning problem with representative variables. In Discrete Applied Mathematics, 211: 1-14, 2016. doi www
2015
Articles de revue
- Extraction de motifs dialogiques bidimensionnels. In Revue des Sciences et Technologies de l'Information - Série RIA : Revue d'Intelligence Artificielle, 29 (6): 655-683, 2015. doi www
2014
Articles de revue
- Modélisation de dialogues pour personnage virtuel narrateur. In Revue des Sciences et Technologies de l'Information - Série RIA : Revue d'Intelligence Artificielle, 28 (1): 101-130, 2014. doi www
Articles de conférence
- Extraction de motifs dialogiques bidimensionnels. In Reconnaissance de Formes et Intelligence Artificielle (RFIA) 2014, pages -, Rouen, France, 2014. www
- Une approche polyédrale pour le K-partitionnement de graphe appliqué `a l'analyse de dialogue. In ROADEF - 15ème congrès annuel de la Société franc caise de recherche opérationnelle et d'aide `a la décision, Bordeaux, France, 2014. www
Thèses et habilitations
2013
Articles de conférence
- Interactive Narration Requires Interaction and Emotion. In 5th International Conference on Agents and Artificial Intelligence, pages -, Barcelone, Spain, 2013. www
2012
Articles de conférence
- A Methodology to Design Human-Like Embodied Conversational Agents. In International Workshop on Human-Agent Interaction Design and Models (HAIDM'12), pages online proceedings, Valencia, Spain, 2012. www
- Modélisation de dialogues narratifs pour la conception d'un ACA narrateur. In WACAI'12 workshop on Affects, Compagnons Artificiels et Interaction, pages 1-8, Grenoble, France, 2012. www
2011
Articles de conférence
- Reconnaissance de motifs dialogiques approchés. In Models Formels de l'Interaction, pages 9-19, Rouen, France, 2011. www