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:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d3cdca2ac8d
DTSTART;TZID=America/Toronto:20200605T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200605T130000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-cedric-koh-0
SUMMARY:Combinatorial Optimization Reading Group - Cedric Koh
CLASS:PUBLIC
DESCRIPTION:TITLE: A Strongly Polynomial Label-Correcting Algorithm for Li
 near\nSystems with Two Variables per Inequality\n\nSpeaker:\n Cedric Koh\n
 \nAffiliation:\n London School of Economics and Political Science\n\nZoom:
 \n Contact Sharat Ibrahimpur\n\nABSTRACT:\n\nIn this talk\, I will present
  a strongly polynomial label-correcting\nalgorithm for solving the feasibi
 lity of linear systems with two\nvariables per inequality. The algorithm i
 s based on the\nNewton–Dinkelbach method for fractional combinatorial op
 timization\,\nand extends previous work of Madani (2002).
DTSTAMP:20260406T151418Z
END:VEVENT
END:VCALENDAR