CALENDRIER

octobre 2018
L M M J V S D
01 02 03 04 05 06 07
08 09 10 11 12 13 14
15 16 17 18 19 20 21
22 23 24 25 26 27 28
29 30 31        

Partager cet événement

Enregistrer cet événement

Séminaire : Learning to branch in MILP solvers

Date
Mardi 11 décembre 2018
Débute à 15:30

Prix
gratuit

Contact
Marilyne Lavoie
Site Web

Lieu
4488
2920, chemin de la Tour
Montréal, QC Canada
H3T 1N8

514 343-6111
Site Web | Itinéraire et carte

Catégories


Consulté 606 fois
Séminaire :  Learning to branch in MILP solvers

Séminaire 'Un chercheur du GERAD vous parle!'

Titre :
Learning to branch in MILP solvers

Conférencier : Maxime Gasse – Polytechnique Montréal, Canada

In this talk I will present the 'learning to branch' research project I am working on, along with some preliminary experimental results. A popular approach for solving mixed integer linear programs (MILPs) is the branch-and-bound (B&B) method, where the solution space is iteratively split in two according to a heuristic branching strategy, until it can be proved either that an optimal solution has been found, or that no solution exists. While powerful branching strategies have been devised over the years to make the solving process faster, we believe there is room for improvement and intend to learn better strategies from data by using machine learning. I will present: i) a formulation of the branching decision problem as a 1-player game; ii) a supervised learning experiment where we try to imitate the strong branching strategy on setcover instances using a graph convolutional network (GCN); iii) a reinforcement learning experiment that intend to improve upon the strategy learned by supervised learning.

---

Du café et des biscuits seront offerts au début du séminaire.
Bienvenue à tous!

© École Polytechnique de Montréal
Bottin | Plan du site | Recherche | Conditions | Besoin d'aide?