23 citations · 79 across the 6 of their papers we have counts for
6 papers · 1 filter
Lookback for Learning to Branch
Prateek Gupta, Elias B. Khalil, Didier Chetélat +4
The expressive and computationally inexpensive bipartite Graph Neural Networks (GNN) have been shown to be an important component of deep learning based Mixed-Integer Linear Progra…
Learning to branch with Tree MDPs
Lara Scavuzzo, Feng Yang Chen, Didier Chételat +4
State-of-the-art Mixed Integer Linear Program (MILP) solvers combine systematic tree search with a plethora of hard-coded heuristics, such as the branching rule. The idea of learni…
The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights
Maxime Gasse, Quentin Cappart, Jonas Charfreitag +38
Combinatorial optimization is a well-established area in operations research and computer science. Until recently, its methods have focused on solving problem instances in isolatio…
Causal Reinforcement Learning using Observational and Interventional Data
Maxime Gasse, Damien Grasset, Guillaume Gaudron +1
Learning efficiently a causal model of the environment is a key challenge of model-based RL agents operating in POMDPs. We consider here a scenario where the learning agent has the…
Ecole: A Library for Learning Inside MILP Solvers
Antoine Prouvost, Justin Dumouchelle, Maxime Gasse +2
In this paper we describe Ecole (Extensible Combinatorial Optimization Learning Environments), a library to facilitate integration of machine learning in combinatorial optimization…
Ecole: A Gym-like Library for Machine Learning in Combinatorial Optimization Solvers
Antoine Prouvost, Justin Dumouchelle, Lara Scavuzzo +3
We present Ecole, a new library to simplify machine learning research for combinatorial optimization. Ecole exposes several key decision tasks arising in general-purpose combinator…