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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e0f68f22fb8
DTSTART;TZID=America/Toronto:20220413T140000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220413T140000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/reading-grou
 p-talk-sean-kafer
SUMMARY:Reading Group Talk - Sean Kafer
CLASS:PUBLIC
DESCRIPTION:TITLE: Generating Short Monotone Paths in 0/1 LPs: From Circui
 ts to\nSimplex\n\nSpeaker:\n Sean Kafer\n\nAffiliation:\n University of Wa
 terloo\n\nZoom:\n 945 0789 9910 (passcode: kafer)\n\nABSTRACT: \n\nEven a
 fter decades of study\, it is unknown whether there exists a\npivot rule f
 or the Simplex method that always solves an LP with only a\npolynomial num
 ber of pivots.  This remains unknown even in the\nspecial case of 0/1 LPs
  - i.e.\, LPs defined over 0/1 polytopes - a\ncase that includes many exte
 nsively studied problems in combinatorial\noptimization.
DTSTAMP:20260416T144743Z
END:VEVENT
END:VCALENDAR