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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d0d146a0b87
DTSTART;TZID=America/Toronto:20230922T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230922T130000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-noah-weninger
SUMMARY:C&O Reading Group - Noah Weninger
CLASS:PUBLIC
DESCRIPTION:TITLE: A Fast Combinatorial Algorithm for the Bilevel Knapsack 
 Problem\nwith Interdiction Constraints\n\nSPEAKER:\n Noah Weninger\n\nAFFI
 LIATION:\n University of Waterloo\n\nLOCATION:\n MC 6029\n\nABSTRACT: We c
 onsider the bilevel knapsack problem with interdiction\nconstraints\, a ge
 neralization of 0-1 knapsack. In this problem\, there\nare two knapsacks a
 nd n items. The objective is to select some items\nto pack into the first 
 knapsack (i.e. interdict) such that the maximum\nprofit attainable from pa
 cking the remaining items into the second\nknapsack is minimized. We prese
 nt a combinatorial branch-and-bound\nalgorithm which outperforms the curre
 nt state-of-the-art solution\nmethod in computational experiments for 99% 
 of the instances reported\nin the literature.
DTSTAMP:20260404T085222Z
END:VEVENT
END:VCALENDAR