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:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cff788373a8
DTSTART;TZID=America/Toronto:20191011T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20191011T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-laurent-poirrier-0
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 55
 01 Waterloo ON N2L 3G1 Canada
SUMMARY:Tutte Colloquium - Laurent Poirrier
CLASS:PUBLIC
DESCRIPTION:TITLE: On the depth of cutting planesOn the depth of cutting p
 lanes\n\nSpeaker:\n Laurent Poirrier\n\nAffiliation:\n University of Water
 loo\n\nRoom:\n MC 5501\n\nABSTRACT:\n\nWe tackle one of the most important
  open problems in computational\ninteger programming: cut selection.\n\nFo
 r four decades\, cutting planes were believed to be useful only for\nstruc
 tured combinatorial problems. This changed in 1995 when Balas\,\nCeria and
  Cornuéjols showed that Gomory cuts could helpfully\nstrengthen the formu
 lation of general integer programming problems.\nSince then\, many other c
 ut generation techniques have been developed\,\nbut their practical succes
 s has been moderate at best.
DTSTAMP:20260403T172320Z
END:VEVENT
END:VCALENDAR