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:682cec70e55b6
DTSTART;TZID=America/Toronto:20230724T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230724T130000
URL:/combinatorics-and-optimization/events/co-reading-g
 roup-matheus-ota
SUMMARY:C&O Reading Group - Matheus Ota
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Hardness of pricing routes for two-stage sto
 chastic vehicle\nrouting problems with scenarios\n\nSPEAKER:\n Matheus Ota
 \n\nAFFILIATION:\n University of À¶Ý®ÊÓƵ\n\nLOCATION:\n MC 6029\n\nABSTRA
 CT: Following state-of-the-art exact algorithms for vehicle\nrouting probl
 ems\, several recent exact algorithms for the two-stage\nvehicle routing p
 roblem with stochastic demands (VRPSD) are based on\nset partitioning form
 ulations. To solve the corresponding LP\nrelaxation\, these algorithms rel
 y on efficient routines for solving\nthe associated pricing problems. In t
 his paper\, we study the\ncomplexity of solving such VRPSD pricing problem
 s.\n 
DTSTAMP:20250520T205616Z
END:VEVENT
END:VCALENDAR