![/system/images/000/000/219/Logo_Journ_es_Optimisation__2012_Outl_default.png](/system/images/000/000/219/Logo_Journ_es_Optimisation__2012_Outl_default.png)
Including an Industrial Optimization Day
HEC Montréal, May 7 - 9, 2012
JOPT2012
HEC Montréal, 7 — 9 May 2012
![](/assets/cal-add-6d138cf3e30399796b32f524ba2175862f0503314e61a73e25c8269466c9e3d9.png)
MC1 Séance plénière 2 / Plenary Session 2
May 7, 2012 02:00 PM – 03:00 PM
Location: Amphithéâtre IBM
Chaired by Bernard Gendron
1 Presentation
-
02:00 PM - 03:00 PM
Recent Advances in Mixed-Integer Linear Programming
The research group at Carleton University has been pursuing a number of new directions in Mixed-Integer Linear Programmingin recent years. This talk summarizes our main new algorithms in two areas: branching methods for reaching integer feasibility faster, and node selection methods for reaching MILP optimality faster. We present a variety of new branching variable and branching
direction selection methods, new methods for general multi-variable branching disjunctions, and the unifying principle of branching to force change. We also present a number of node selection methods that exploit correlation and distribution characteristics of branch and bound trees to
trigger backtracking and to choose the next node to solve when backtracking.