Friday, October 21, 2022

Friday, October 21, 2022 — 12:00 to 12:00 PM EDT

Title: The Probabilistic Set-Covering Problem

Speaker: Noah Weninger Affiliation: University of Waterloo Location: MC 6026 or contact Rian Neogi for Zoom link

Abstract: In the classical set-covering problem, we have a set of items and a set S of subsets of the items. The objective is to find a min-cost subset C of S which covers every item, i.e., where every item is contained in at least one of the subsets in C. The probabilistic set-covering problem (PSC) generalizes this to a stochastic setting where the objective is to find a min-cost covering which covers a random subset of the items with probability at least p. We will discuss some structural properties of this problem which lead to a branch-and-bound algorithm for solving it.

S M T W T F S
25
26
27
28
29
30
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
5
  1. 2022 (143)
    1. December (1)
    2. November (18)
    3. October (15)
    4. September (11)
    5. August (2)
    6. July (17)
    7. June (17)
    8. May (10)
    9. April (12)
    10. March (18)
    11. February (10)
    12. January (13)
  2. 2021 (103)
    1. December (3)
    2. November (7)
    3. October (6)
    4. September (12)
    5. August (6)
    6. July (10)
    7. June (12)
    8. May (7)
    9. April (9)
    10. March (13)
    11. February (8)
    12. January (10)
  3. 2020 (119)
  4. 2019 (167)
  5. 2018 (136)
  6. 2017 (103)
  7. 2016 (137)
  8. 2015 (136)
  9. 2014 (88)
  10. 2013 (48)
  11. 2012 (39)
  12. 2011 (36)
  13. 2010 (40)
  14. 2009 (40)
  15. 2008 (39)
  16. 2007 (15)