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:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf6aae0ecfd
DTSTART;TZID=America/Toronto:20200904T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200904T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-joseph-paat
SUMMARY:Tutte Colloquium - Joseph Paat
CLASS:PUBLIC
DESCRIPTION:TITLE: Recent proximity results in integer linear programming\
 n\nSpeaker:\n Joseph Paat\n\nAffiliation:\n UBC Sauder School of Business\
 n\nZoom:\n Please email Emma Watson.\n\nABSTRACT:\n\nWe consider the pro
 ximity question in integer linear programming\n(ILP) --- Given a vect
 or in a polyhedron\, how close is the nearest\ninteger vector? Proximity
  has been studied for decades with two\ninfluential results due to Cook
  et al. in 1986 and Eisenbrand and\nWeismantel in 2018. We derive new up
 per bounds on proximity using\nsparse integer solutions and mixed integer 
 relaxations of the integer\nhull. When compared to previous bounds\, these
  new bounds depend\nless on the dimensions of the constraint matrix and m
 ore on the data\nin the matrix.
DTSTAMP:20260403T072222Z
END:VEVENT
END:VCALENDAR