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:682cec7fe01cf
DTSTART;TZID=America/Toronto:20230731T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230731T130000
URL:/combinatorics-and-optimization/events/co-reading-g
 roup-matheus-ota-0
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\, Part II\n\nSPEAKER:\n M
 atheus Ota\n\nAFFILIATION:\n University of À¶Ý®ÊÓƵ\n\nLOCATION:\n MC 6029
 \n\nABSTRACT: Following state-of-the-art exact algorithms for vehicle\nrou
 ting problems\, several recent exact algorithms for the two-stage\nvehicle
  routing problem with stochastic demands (VRPSD) are based on\nset partiti
 oning formulations. To solve the corresponding LP\nrelaxation\, these algo
 rithms rely on efficient routines for solving\nthe associated pricing prob
 lems. In this paper\, we study the\ncomplexity of solving such VRPSD prici
 ng problems.\n 
DTSTAMP:20250520T205631Z
END:VEVENT
END:VCALENDAR