BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Aleksandr Kazachkov (University of Florida)
DTSTART:20210527T171500Z
DTEND:20210527T174500Z
DTSTAMP:20260415T000011Z
UID:MIP2021/23
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/MIP2021/23/"
 >Strengthening V-polyhedral disjunctive cuts</a>\nby Aleksandr Kazachkov (
 University of Florida) as part of Mixed Integer Programming Workshop 2021\
 n\n\nAbstract\nThe V-polyhedral framework is a recent approach for generat
 ing disjunctive cutting planes for mixed-integer linear programs. Unlike t
 he lift-and-project method\, which requires the construction of a computat
 ionally demanding higher-dimensional formulation\, V-polyhedral disjunctiv
 e cuts can be computed via a linear program in the same dimension as the o
 riginal problem. However\, without the values of the extra variables used 
 for lift-and-project cuts\, one cannot directly apply a posteriori cut str
 engthening techniques such as monoidal strengthening. We show how the valu
 es of those extra variables can be computed efficiently\, and thereby lay 
 the groundwork for strengthening arbitrary valid disjunctive cuts. We pres
 ent computational experiments with this idea on V-polyhedral disjunctive c
 uts.\n
LOCATION:https://researchseminars.org/talk/MIP2021/23/
END:VEVENT
END:VCALENDAR