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:69d1536724999
DTSTART;TZID=America/Toronto:20230731T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230731T130000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-matheus-ota-0
SUMMARY:C&O Reading Group - Matheus Ota
CLASS:PUBLIC
DESCRIPTION:TITLE: Hardness of pricing routes for two-stage stochastic vehi
 cle\nrouting problems with scenarios\, Part II\n\nSPEAKER:\n Matheus Ota\n
 \nAFFILIATION:\n University of Waterloo\n\nLOCATION:\n MC 6029\n\nABSTRACT
 : Following state-of-the-art exact algorithms for vehicle\nrouting problem
 s\, several recent exact algorithms for the two-stage\nvehicle routing pro
 blem with stochastic demands (VRPSD) are based on\nset partitioning formul
 ations. To solve the corresponding LP\nrelaxation\, these algorithms rely 
 on efficient routines for solving\nthe associated pricing problems. In thi
 s paper\, we study the\ncomplexity of solving such VRPSD pricing problems.
DTSTAMP:20260404T180735Z
END:VEVENT
END:VCALENDAR