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:69ed8c4357414
DTSTART;TZID=America/Toronto:20201023T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20201023T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-david-p-williamson
SUMMARY:Tutte Colloquium - David P. Williamson
CLASS:PUBLIC
DESCRIPTION:TITLE: Semidefinite Programming Relaxations of the Traveling S
 alesman\nProblem\n\nSpeaker:\n David P. Williamson\n\nAffiliation:\n Corne
 ll University\n\nZoom:\n Please email Emma Watson\n\nABSTRACT:\n\nFinding
  a polynomial-time solvable relaxation of the traveling\nsalesman problem 
 whose integrality gap better matches what is seen in\npractice has been an
  outstanding open problem in combinatorial\noptimization for some time.  
 We study several semidefinite\nprogramming relaxations of the traveling sa
 lesman problem proposed in\nthe literature and show that all known relaxat
 ions have an unbounded\nintegrality gap.
DTSTAMP:20260426T035339Z
END:VEVENT
END:VCALENDAR