BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/Chicago
BEGIN:DAYLIGHT
DTSTART:20250309T030000
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZNAME:CDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20241103T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZNAME:CST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP;TZID=America/Chicago:20260409T060927
UID:202989@calendar.wisc.edu
DTSTART;TZID=America/Chicago:20241206T140000
DTEND;TZID=America/Chicago:20241206T150000
DESCRIPTION:Alberto Del Pia. Mixed integer quadratic programming is the pro
 blem of minimizing a quadratic polynomial over points in a polyhedral regi
 on with some integer components. It is a natural extension of mixed intege
 r linear programming\, and it has a wide array of applications. In this ta
 lk\, I will survey some recent theoretical developments in mixed integer q
 uadratic programming\, with a focus on complexity\, algorithms\, and funda
 mental properties.\n\nCONTACT: silwal@cs.wisc.edu
LOCATION:3310 Computer Sciences
SUMMARY:CS Theory Seminar: Minimizing quadratics over integers
END:VEVENT
END:VCALENDAR