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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d0d148a6e2b
DTSTART;TZID=America/Toronto:20231020T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20231020T130000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-madison-van-dyk
SUMMARY:C&O Reading Group - Madison Van Dyk
CLASS:PUBLIC
DESCRIPTION:TITLE: Fast Combinatorial Algorithms for Efficient Sortation\n\
 nSPEAKER:\n Madison Van Dyk\n\nAFFILIATION:\n University of Waterloo\n\nLO
 CATION:\n MC 6029\n\nABSTRACT: Modern parcel logistic networks are designe
 d to ship demand\nbetween given origin\, destination pairs of nodes in an 
 underlying\ndirected network. Efficiency dictates that volume needs to be\
 nconsolidated at intermediate nodes in typical hub-and-spoke fashion.\nIn 
 practice\, such consolidation requires parcel-sortation. In this\nwork\, w
 e propose a mathematical model for the physical requirements\,\nand limita
 tions of parcel sortation.
DTSTAMP:20260404T085224Z
END:VEVENT
END:VCALENDAR