Zacharie Alès

Orcid: 0000-0003-4602-2638

According to our database1, Zacharie Alès authored at least 25 papers between 2013 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Planning in Branch-and-Bound: Model-Based Reinforcement Learning for Exact Combinatorial Optimization.
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

2025
Planning in Branch-and-Bound: Model-Based Reinforcement Learning for Exact Combinatorial Optimization.
CoRR, November, 2025

Influence branching for learning to solve mixed-integer programs online.
CoRR, October, 2025

A rounding and clustering-based exact algorithm for the p-center problem.
Comput. Oper. Res., 2025

A Markov Decision Process for Variable Selection in Branch & Bound.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

2024
Correlation Clustering Problem Under Mediation.
INFORMS J. Comput., 2024

New optimization models for optimal classification trees.
Comput. Oper. Res., 2024

2023
Robust MILP formulations for the two-stage weighted vertex p-center problem.
Comput. Oper. Res., November, 2023

An efficient benders decomposition for the p-median problem.
Eur. J. Oper. Res., July, 2023

Minimizing recovery cost of network optimization problems.
Networks, January, 2023

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

2021
Multi-objective optimization for VM placement in homogeneous and heterogeneous cloud service provider data centers.
Computing, 2021

2020
The K-partitioning problem: Formulations and branch-and-cut.
Networks, 2020

Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

2019
Valid constraints for time-indexed formulations of job scheduling problems with distinct time windows and sequence-dependent setup times.
Proceedings of the 9th International Network Optimization Conference, 2019

2018
Extraction and Clustering of Two-Dimensional Dialogue Patterns.
Int. J. Artif. Intell. Tools, 2018

Minimizing the weighted sum of completion times under processing time uncertainty.
Electron. Notes Discret. Math., 2018

Compact MILP Formulations for the p-Center Problem.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2017
Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties.
Comput. Oper. Res., 2017

2016
An extended edge-representative formulation for the K-partitioning problem.
Electron. Notes Discret. Math., 2016

Polyhedral combinatorics of the K-partitioning problem with representative variables.
Discret. Appl. Math., 2016

2015
Extraction de motifs dialogiques bidimensionnels.
Rev. d'Intelligence Artif., 2015

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).
PhD thesis, 2014

Modélisation de dialogues pour personnage virtuel narrateur.
Rev. d'Intelligence Artif., 2014

2013
Interactive Narration Requires Interaction and Emotion.
Proceedings of the ICAART 2013, 2013


  Loading...