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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:682e21094732f
DTSTART;TZID=America/Toronto:20221118T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20221118T120000
URL:/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-madison-van-dyk-1
SUMMARY:Combinatorial Optimization Reading Group - Madison Van Dyk
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTitle: Approximation algorithms for stochastic orie
 nteering   \n\nSpeaker:\n Madison Van Dyk\n\nAffiliation:\n University of
  À¶Ý®ÊÓƵ\n\nLocation:\n MC 6029 or contact Rian Neogi for Zoom link\n\nAb
 stract: This week we revisit the stochastic orienteering problem in\nwhic
 h we are given a metric graph where each node has a deterministic\nreward 
 and a random size. The goal is to adaptively decide on which\nnodes to vis
 it to maximize the expected reward\, while not exceeding\nthe budget B on 
 the distance plus the size of jobs processed. \n 
DTSTAMP:20250521T185257Z
END:VEVENT
END:VCALENDAR