BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
CALSCALE:GREGORIAN
PRODID:-//WordPress - MECv7.32.0//EN
X-ORIGINAL-URL:https://www.cmm.uchile.cl/
X-WR-CALNAME:CMM
X-WR-CALDESC:Centro de Modelamiento Matemático
X-WR-TIMEZONE:America/Santiago
BEGIN:VTIMEZONE
TZID:America/Santiago
X-LIC-LOCATION:America/Santiago
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0400
TZNAME:-04
DTSTART:20260507T092435
END:STANDARD
END:VTIMEZONE
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-PUBLISHED-TTL:PT1H
X-MS-OLK-FORCEINSPECTOROPEN:TRUE
BEGIN:VEVENT
CLASS:PUBLIC
UID:MEC-908609f544e098099cfa14170e16ab90@cmm.uchile.cl
DTSTART;TZID=America/Santiago:20260506T150000
DTEND;TZID=America/Santiago:20260506T160000
DTSTAMP:20260506T102336Z
CREATED:20260506
LAST-MODIFIED:20260506
PRIORITY:5
SEQUENCE:2
TRANSP:OPAQUE
SUMMARY:AGCO Seminar: Parametric Polyhedra in Mixed-Integer Programming
DESCRIPTION:Abstract: \nWe present some old and new results on arbitrary families of parametric polyhedra. First, if the constraint matrix is fixed, in the literature there are structural results for the integer hull and the finiteness of cutting plane closures for varying r.h.s. For instance, recently, Becu et al. proved in “Approximating the Gomory Mixed-Integer Cut Closure Using Historical Data” that the GMI closure of this family is finitely generated, in the sense that there exists a finite list of aggregation weights defining the GMI cuts that give the GMI closure for any polyhedra in the family. We extend this result for other cutting plane closures. Second, if the family of parametric polyhedra is arbitrary but all polyhedra in the family have the same integer hull, they define the same MIP, and we can leverage this information to understand and solve MIPs better. These families have been used to understand theoretical properties of the rank of cutting planes and to obtain better formulations. We present an application of these same-integer-hull families to formulations for the Asymmetric Traveling Salesman Problem. This is joint work with Jason Dai, Rensselaer Polytechnic Institute; Gustavo Angulo, Pontificia Universidad Católica de Chile; Silvia Di Gregorio, Sorbonne Paris Nord University.\n \nSpeakers: Diego Morán, Rensselaer Polytechnic Institute\nWhen: May 6, 3:00 pm – 4:00 pm.\nWhere: Sala de Seminario von Neuman, 7th floor, CMM, Av. Beauchef 851, Torre Norte.\n \n
URL:https://www.cmm.uchile.cl/events/agco-seminar-parametric-polyhedra-in-mixed-integer-programming/
END:VEVENT
END:VCALENDAR
