Gaël Glorian

According to our database, Gaël Glorian authored at least 11 papers between 2017 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

A Constraint Programming Model for Scheduling the Unloading of Trains in Ports: Extended.

Guillaume Perez, Gael Glorian, Wijnand Suijlen, Arnaud Lallouet

CoRR, 2023

A Constraint Programming Model for Scheduling the Unloading of Trains in Ports.

Guillaume Perez, Gaël Glorian, Wijnand Suijlen, Arnaud Lallouet

Proceedings of the 35th IEEE International Conference on Tools with Artificial Intelligence, 2023

Distribution Optimization in Constraint Programming.

Guillaume Perez, Gaël Glorian, Wijnand Suijlen, Arnaud Lallouet

Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

Generalized Confidence Constraints.

Guillaume Perez, Steve Malalel, Gael Glorian, Victor Jung, Alexandre Papadopoulos, Marie Pelleau, Wijnand Suijlen, Jean-Charles Régin, Arnaud Lallouet

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

A Deep Reinforcement Learning Heuristic for SAT based on Antagonist Graph Neural Networks.

Thomas Fournier, Arnaud Lallouet, Télio Cropsal, Gaël Glorian, Alexandre Papadopoulos, Antoine Petitet, Guillaume Perez, Suruthy Sekar, Wijnand Suijlen

Proceedings of the 34th IEEE International Conference on Tools with Artificial Intelligence, 2022

2021

The Dungeon Variations Problem Using Constraint Programming.

Gaël Glorian, Adrien Debesson, Sylvain Yvon-Paliot, Laurent Simon

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

2020

NACRE - A Nogood And Clause Reasoning Engine.

Gael Glorian, Jean-Marie Lagniez, Christophe Lecoutre

Proceedings of the LPAR 2020: 23rd International Conference on Logic for Programming, 2020

2019

Hybridation de techniques d'apprentissage de clauses en programmation par contraintes. (Hybridization of clause learning techniques in constraint programming).

Gael Glorian

PhD thesis, 2019

An Incremental SAT-Based Approach to the Graph Colouring Problem.

Gael Glorian, Jean-Marie Lagniez, Valentin Montmirail, Nicolas Szczepanski

Proceedings of the Principles and Practice of Constraint Programming, 2019

2018

An Incremental SAT-Based Approach to Reason Efficiently on Qualitative Constraint Networks.

Gael Glorian, Jean-Marie Lagniez, Valentin Montmirail, Michael Sioutis

Proceedings of the Principles and Practice of Constraint Programming, 2018

2017

Combining Nogoods in Restart-Based Search.

Gael Glorian, Frédéric Boussemart, Jean-Marie Lagniez, Christophe Lecoutre, Bertrand Mazure

Proceedings of the Principles and Practice of Constraint Programming, 2017