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:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a5aa20d1fe20
DTSTART;TZID=America/Toronto:20260717T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260717T123000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combopt-read
 inggroup-noah-weninger-improved-algorithms
SUMMARY:CombOpt ReadingGroup - Noah Weninger-Improved algorithms for\nshort
 est-path network interdiction
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Noah Weninger\n\nAFFILIATION:\n University of Waterl
 oo\n\nLOCATION:\n MC 5029\n\nABSTRACT: \n\nIn the shortest-path network i
 nterdiction problem\, the objective is to\nselect a set $X$ of arcs in a d
 irected graph $G=(V\,A)$\, subject to a\nknapsack constraint on $X$\, such
  that the shortest $s$-$t$ path length\nin $(V\,A\\setminus X)$ is maximiz
 ed. We present an improved version of\nthe classic Israeli-Wood Benders co
 vering decomposition (2002). Our\nmethod is based on new upper and lower b
 ounds for the problem which\nintegrate cleanly into the Benders decomposit
 ion\, causing many\niterations to be skipped. Using similar techniques\, w
 e also derive new\ncovering heuristics\, which further reduce the running 
 time. In\ncomputational experiments\, our improved algorithm achieves spee
 dups of\nup to two orders of magnitude. The speedup is most notable on the
  more\ndifficult large\, dense graphs: we can often solve instances on\nco
 mplete graphs with 1000 vertices and uniformly distributed weights\nand co
 sts within a few minutes. \nThis is joint work with Amir Dadpour and Ricar
 do Fukasawa.
DTSTAMP:20260717T214341Z
END:VEVENT
END:VCALENDAR