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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d0b42d92dd2
DTSTART;TZID=America/Toronto:20240412T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240412T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-bertrand-guenin-0
SUMMARY:Tutte Colloquium - Bertrand Guenin
CLASS:PUBLIC
DESCRIPTION:TITLE: Bridging the gap between Linear and Integer Programming\
 n\nSPEAKER:\n Bertrand Guenin\n\nAFFILIATION:\n University of Waterloo\n\n
 LOCATION:\n MC 5501\n\nABSTRACT: Informally\, an Integer Program is obtain
 ed from a Linear\nProgram by adding the condition that some variables be r
 estricted to\nbe integer. What kind of other restrictions lead to interest
 ing\nclasses of optimization problems? One such class of problems is\nobta
 ined by restricting the variables in a Linear Program to be dyadic\nration
 als\, i.e. rationals where the denominator is a power of two.\nThese probl
 ems borrow features from both Linear Programming and\nInteger Programming.
  Notably\, they can be solved in polynomial time\,\nbut optimal solutions 
 may have large support.
DTSTAMP:20260404T064813Z
END:VEVENT
END:VCALENDAR