BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:Eventi DIAG
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:STANDARD
DTSTART:20221030T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20220327T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.24906.field_data.0@www.diag.uniroma1.it
DTSTAMP:20230323T195936Z
CREATED:20220606T110103Z
DESCRIPTION:AbstractIn multi-objective mixed-integer convex optimization mu
ltiple convex objective functions need to be optimized simultaneously whil
e some of the variables are only allowed to take integer values. In this t
alk\, we present a new approach to compute an enclosure of the nondominate
d set of such optimization problems. More precisely\, we decompose the mul
ti-objective mixed-integer convex optimization problem into several multi-
objective continuous convex optimization problems\, which we refer to as p
atches. We then dynamically compute and improve coverages of the nondomina
ted sets of those patches to finally combine them to obtain an enclosure o
f the nondominated set of the multi-objective mixed-integer convex optimiz
ation problem. Additionally\, we introduce a mechanism to reduce the numbe
r of patches that need to be considered in total.
DTSTART;TZID=Europe/Paris:20220607T150000
DTEND;TZID=Europe/Paris:20220607T150000
LAST-MODIFIED:20220606T130610Z
LOCATION:Aula A7
SUMMARY:Using hybrid patch decomposition to solve multi-objective mixed-int
eger convex optimization problems - Leo Warnow (TU Ilmenau)
URL;TYPE=URI:https://www.diag.uniroma1.it/node/24906
END:VEVENT
END:VCALENDAR