Interactive Narration Requires Interaction and Emotion. - Alexandre Pauchet; François Rioult; Émilie Chanoni; Zacharie Alès; Ovidiu Serban (ICAART (2), 2013)

Modélisation de dialogues pour personnage virtuel narrateur. - Ovidiu Serban; Anne Bersoult; Zacharie Alès; Elise Lebertois; Émilie Chanoni; François Rioult; Alexandre Pauchet (Rev. d'Intelligence Artif., 2014)

Extraction et partitionnement pour la recherche de régularités : application à l'analyse de dialogues. (Extraction and clustering for regularities identification : application to dialogues analysis). - Zacharie Alès (2014)

Extraction de motifs dialogiques bidimensionnels. - Zacharie Alès; Alexandre Pauchet; Arnaud Knippel; Laurent Vercouter; Christian Gout (Rev. d'Intelligence Artif., 2015)

Polyhedral combinatorics of the K-partitioning problem with representative variables. - Zacharie Alès; Arnaud Knippel; Alexandre Pauchet (Discret. Appl. Math., 2016)

An extended edge-representative formulation for the K-partitioning problem. - Zacharie Alès; Arnaud Knippel (Electron. Notes Discret. Math., 2016)

Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties. - Bruno Ferreira Rosa; Marcone Jamilson Freitas Souza; Sérgio Ricardo de Souza; Moacir Felizardo de França Filho; Zacharie Alès; Philippe Yves Paul Michelon (Comput. Oper. Res., 2017)

Compact MILP Formulations for the p-Center Problem. - Zacharie Alès; Sourour Elloumi (ISCO, 2018)

Minimizing the weighted sum of completion times under processing time uncertainty. - Zacharie Alès; Thi Sang Nguyen; Michael Poss (Electron. Notes Discret. Math., 2018)

Extraction and Clustering of Two-Dimensional Dialogue Patterns. - Zacharie Alès; Alexandre Pauchet; Arnaud Knippel (Int. J. Artif. Intell. Tools, 2018)

Valid constraints for time-indexed formulations of job scheduling problems with distinct time windows and sequence-dependent setup times. - Bruno Ferreira Rosa; Marcone Jamilson Freitas Souza; Sérgio Ricardo de Souza; Zacharie Alès; Philippe Yves Paul Michelon (INOC, 2019)

Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm. - Marc Etheve; Zacharie Alès; Côme Bissuel; Olivier Juan; Safia Kedad-Sidhoum (CPAIOR, 2020)

The K-partitioning problem: Formulations and branch-and-cut. - Zacharie Alès; Arnaud Knippel (Networks, 2020)

Multi-objective optimization for VM placement in homogeneous and heterogeneous cloud service provider data centers. - Rym Regaieg; Mohamed Koubàa; Zacharie Alès; Taoufik Aguili (Computing, 2021)

Contributions à la résolution de problèmes d'optimisation combinatoire difficiles. (Contributions to solving hard combinatorial optimization problems). - Zacharie Alès (2023)

Minimizing recovery cost of network optimization problems. - Zacharie Alès; Sourour Elloumi (Networks, 2023)

An efficient benders decomposition for the p-median problem. - Cristian Duran-Mateluna; Zacharie Alès; Sourour Elloumi (Eur. J. Oper. Res., 2023)

Robust MILP formulations for the two-stage weighted vertex p-center problem. - Cristian Duran-Mateluna; Zacharie Alès; Sourour Elloumi; Natalia Jorquera-Bravo (Comput. Oper. Res., 2023)

New optimization models for optimal classification trees. - Zacharie Alès; Valentine Huré; Amélie Lambert (Comput. Oper. Res., 2024)

Correlation Clustering Problem Under Mediation. - Zacharie Alès; Céline Engelbeen; Rosa Figueiredo 001 (INFORMS J. Comput., 2024)

A rounding and clustering-based exact algorithm for the p-center problem. - Zacharie Alès; Cristian Duran-Mateluna; Sourour Elloumi (Comput. Oper. Res., 2025)