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:69e3d39ea39e9
DTSTART;TZID=America/Toronto:20221021T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20221021T120000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-noah-weninger
SUMMARY:Combinatorial Optimization Reading Group - Noah Weninger
CLASS:PUBLIC
DESCRIPTION:Title: The Probabilistic Set-Covering Problem\n\nSpeaker:\n No
 ah Weninger\n\nAffiliation:\n University of Waterloo\n\nLocation:\n MC 602
 6 or contact Rian Neogi for Zoom link\n\nAbstract: In the classical set-co
 vering problem\, we have a set of\nitems and a set S of subsets of the ite
 ms. The objective is to find a\nmin-cost subset C of S which covers every 
 item\, i.e.\, where every item\nis contained in at least one of the subset
 s in C. The probabilistic\nset-covering problem (PSC) generalizes this to 
 a stochastic setting\nwhere the objective is to find a min-cost covering w
 hich covers a\nrandom subset of the items with probability at least p. We 
 will\ndiscuss some structural properties of this problem which lead to a\n
 branch-and-bound algorithm for solving it.
DTSTAMP:20260418T185526Z
END:VEVENT
END:VCALENDAR