BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//pretalx.com//juliacon2023//speaker//MLJG3F
BEGIN:VTIMEZONE
TZID:US/Eastern
BEGIN:DAYLIGHT
DTSTART:20220726T000000
TZNAME:EDT
TZOFFSETFROM:-0400
TZOFFSETTO:-0400
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20221106T020000
RDATE:20231105T020000
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20230312T030000
RDATE:20240310T030000
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
SUMMARY:Polyhedral Computation - Benoît Legat
DTSTART;TZID=US/Eastern:20230726T152000
DTEND;TZID=US/Eastern:20230726T153000
DTSTAMP:20261005T154059Z
UID:pretalx-juliacon2023-JP3SPX@pretalx.com
DESCRIPTION:Polyhedra are at the foundation of many engineering tools such
  as Mixed-Integer Programming. Manipulating them can give key insights
LOCATION:32-124
URL:https://pretalx.com/juliacon2023/talk/JP3SPX/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Polynomial Optimization - Benoît Legat
DTSTART;TZID=US/Eastern:20230728T110000
DTEND;TZID=US/Eastern:20230728T113000
DTSTAMP:20261005T154059Z
UID:pretalx-juliacon2023-XLT8H3@pretalx.com
DESCRIPTION:Polynomial Optimization can be solved in a variety of ways. Ju
 MP provides an unified interface for modelling these problems. In this tal
 k\, we show how to interface each type of polynomial optimization solver t
 o this model and how they compare on a variety of benchmark problems.
LOCATION:32-155
URL:https://pretalx.com/juliacon2023/talk/XLT8H3/
END:VEVENT
END:VCALENDAR