BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cff4a328893
DTSTART;TZID=America/Toronto:20191122T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20191122T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-aleksandr-kazachkov
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 55
 01 Waterloo ON N2L 3G1 Canada
SUMMARY:Tutte Colloquium - Aleksandr Kazachkov
CLASS:PUBLIC
DESCRIPTION:TITLE: Disjunctive Cuts through the V-Polyhedral Lens\n\nSpeak
 er:\n Aleksandr Kazachkov\n\nAffiliation:\n Polytechnique Montréal\n\nRoo
 m:\n MC 5501\n\nABSTRACT:\n\nCutting planes\, or cuts\, are a critical com
 ponent of modern integer\nprogramming solvers\, but existing cuts implemen
 ted in solvers are\nrelatively simple compared to those in the literature.
  We discuss the\nprimary reasons for this disparity\, as well as our recen
 tly-proposed\nV-polyhedral framework for mitigating some of these difficul
 ties\nencountered by prior \"stronger\" cuts.
DTSTAMP:20260403T171059Z
END:VEVENT
END:VCALENDAR