activity
20042026
most citedLearning a Generic Value-Selection Heuristic Inside a Constraint Programming Solver

521 citations · 598 across the 18 of their papers we have counts for

collaborators
Showing cs.AIShow all

6 papers · 1 filter

cs.AI2023★ 521 cited

Learning a Generic Value-Selection Heuristic Inside a Constraint Programming Solver

Tom Marty, Tristan François, Pierre Tessier +3

Constraint programming is known for being an efficient approach for solving combinatorial problems. Important design choices in a solver are the branching heuristics, which are des…

cs.AI2020

Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization

Quentin Cappart, Thierry Moisan, Louis-Martin Rousseau +2

Combinatorial optimization has found applications in numerous fields, from aerospace to transportation planning and economics. The goal is to find an optimal solution among a finit…

cs.AI2019

A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints

Minh Hoàng Hà, Tat Dat Nguyen, Thinh Nguyen Duy +3

We consider a vehicle routing problem which seeks to minimize cost subject to time window and synchronization constraints. In this problem, the fleet of vehicles is categorized int…

cs.AI2019★ 11 cited

How to Evaluate Machine Learning Approaches for Combinatorial Optimization: Application to the Travelling Salesman Problem

Antoine François, Quentin Cappart, Louis-Martin Rousseau

Combinatorial optimization is the field devoted to the study and practice of algorithms that solve NP-hard problems. As Machine Learning (ML) and deep learning have popularized, se…

cs.AI2018

Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning

Quentin Cappart, Emmanuel Goutierre, David Bergman +1

Finding tight bounds on the optimal solution is a critical element of practical solution methods for discrete optimization problems. In the last decade, decision diagrams (DDs) hav…

cs.AI2004★ 8 cited

On Global Warming (Softening Global Constraints)

Willem Jan van Hoeve, Gilles Pesant, Louis-Martin Rousseau

We describe soft versions of the global cardinality constraint and the regular constraint, with efficient filtering algorithms maintaining domain consistency. For both constraints,…