Including an Industrial Optimization Day

HEC Montréal, May 7 - 9, 2012


HEC Montréal, 7 — 9 May 2012

Schedule Authors My Schedule

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

    • John Chinneck, presenter, Carleton University

    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.