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:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e3a47c5df8b
DTSTART;TZID=America/Toronto:20220805T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220805T130000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-david-aleman
SUMMARY:Combinatorial Optimization Reading Group - David Aleman
CLASS:PUBLIC
DESCRIPTION:TITLE: Stochastic Knapsack Problem\n\nSpeaker:\n David Aleman\n
 \nAffiliation:\n University of Waterloo\n\nLocation:\n MC 6029\, please co
 ntact Rian Neogi for Zoo link\n\nABSTRACT: The classical NP-hard Knapsack 
 problem takes as input a set\nof items with some fixed values and weights.
  The goal is to compute a\nsubset of items of maximum total value\, subjec
 t to the constraint that\nthe total weight of these elements is less than 
 or equal to a given\nlimit. In this talk we will review a paper by Dean\, 
 Goemans and\nVondrák\, in which an stochastic variation of this problem 
 is\nconsidered. 
DTSTAMP:20260418T153420Z
END:VEVENT
END:VCALENDAR