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:69d1671326577
DTSTART;TZID=America/Toronto:20200508T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200508T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-ricardo-fukasawa-0
SUMMARY:Tutte Colloquium - Ricardo Fukasawa
CLASS:PUBLIC
DESCRIPTION:Zoom (for information email emma.watson@uwaterloo.ca) \n\nTI
 TLE: Hardness of set-partitioning formulation for the vehicle\nrouting pr
 oblem with stochastic demands\n\nSpeaker:\n Ricardo Fukasawa\n\nAffiliatio
 n:\n University of Waterloo\n\nLocation:\n Online (Zoom)\n\nABSTRACT:\n\nT
 he vehicle routing problem considers the cheapest way to serve a set\nof c
 ustomers using a fixed set of vehicles. When a vehicle serves a\ncustomer\
 , it picks up its demand which is given as an input\, and the\ntotal deman
 d picked up cannot exceed the vehicle’s capacity. This\nclassical combi
 natorial optimization problem combines aspects of\nrouting (like a traveli
 ng salesman problem) and packing (like a\nknapsack problem).
DTSTAMP:20260404T193131Z
END:VEVENT
END:VCALENDAR