BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Elias Khalil (Polytechnique Montréal)
DTSTART:20210526T164500Z
DTEND:20210526T171500Z
DTSTAMP:20260415T001714Z
UID:MIP2021/15
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/MIP2021/15/"
 >Revisiting Backdoors In Integer Programming</a>\nby Elias Khalil (Polytec
 hnique Montréal) as part of Mixed Integer Programming Workshop 2021\n\n\n
 Abstract\nA backdoor is a small set of variables that leads to a certifica
 te branch-and-bound tree for a mixed-integer program: it suffices to branc
 h on the backdoor variables to solve an instance to global optimality or c
 onclude infeasibility. Experimental results by Dilkina et al. (2009) and F
 ischetti-Monaci (2011) have shown that many MILP instances from MIPLIB adm
 it backdoors of sizes 10-20\, which may lead to smaller branch-and-bound t
 rees if identified efficiently. We revisit the problem of finding small ba
 ckdoors to MILP problems from the perspective of reinforcement learning an
 d heuristic search and propose a new algorithm with some practical advanta
 ges over existing approaches.\n
LOCATION:https://researchseminars.org/talk/MIP2021/15/
END:VEVENT
END:VCALENDAR