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:69e3fcdbd8bc9
DTSTART;TZID=America/Toronto:20221104T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20221104T120000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-david-aleman-0
SUMMARY:Combinatorial Optimization Reading Group - David Aleman
CLASS:PUBLIC
DESCRIPTION:TITLE: Approximation Algorithms for Stochastic Knapsack \n\nS
 peaker:\n David Aleman\n\nAffiliation:\n University of Waterloo\n\nLocatio
 n:\n MC 6029 or contact Rian Ne\n\nABSTRACT: The classical Knapsack prob
 lem takes as input a set of\nitems with some fixed nonnegative values and 
 weights. The goal is to\ncompute a subset of items of maximum total value\
 , subject to the\nconstraint that the total weight of these elements is at
  most a given\nlimit. In this talk we review a paper by Gupta\, Krishnaswa
 my\, Molinaro\nand Ravi\, in which the following stochastic variation of 
 this problem\nis considered: the value and weight of each item are correl
 ated\nrandom variables with known\, arbitrary distributions.
DTSTAMP:20260418T215123Z
END:VEVENT
END:VCALENDAR