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:6a58038d074f5
DTSTART;TZID=America/Toronto:20260724T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260724T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-francisco-j-aragon-artacho-graph-based
SUMMARY:Tutte Colloquium -Francisco J. Aragón Artacho-Graph-based splittin
 g\nalgorithms for optimization and feasibility problems
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Francisco J. Aragón Artacho\n\nAFFILIATION:\n Unive
 rsity of Alicante\n\nLOCATION:\n MC 5501\n\nABSTRACT: When an optimizatio
 n problem is structured\, it is normally\nadvantageous to use this feature
  when designing algorithms to solve\nit. Following the divide-and-conquer 
 paradigm\, splitting algorithms\niteratively solve simpler problems that a
 re defined by separately\nusing some parts of the original problem. In thi
 s talk\, we will recall\nsome classical methods and present some recent ad
 vances in this\nsubject\, paying special attention to splitting methods de
 vised by\ngraphs.
DTSTAMP:20260715T220253Z
END:VEVENT
END:VCALENDAR