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:20191027T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20190331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.18197.field_data.0@www.glad.uniroma1.it
DTSTAMP:20260403T174200Z
CREATED:20190604T184606Z
DESCRIPTION:In this talk\, we present a learning approach to find good solu
 tions for Binary Quadratic Programming. The proposed approach is based on 
 learning a linear objective function which can then be used to optimize a 
 linear binary program that provides a good feasible solution for the binar
 y quadratic program and is computationally cheaper. The learning approach 
 is inspired from conjoint analysis which can be formulated as a convex qua
 dratic program. Computational results comparing the proposed approach to s
 olving binary quadratic programs using CPLEX are presented.
DTSTART;TZID=Europe/Paris:20190611T120000
DTEND;TZID=Europe/Paris:20190611T120000
LAST-MODIFIED:20200723T170735Z
LOCATION:Aula A4 - DIAG
SUMMARY:Learning\, Conjoint Analysis\, and Binary Quadratic Optimization - 
 Joe Naoum-Sawaya
URL;TYPE=URI:http://www.glad.uniroma1.it/node/18197
END:VEVENT
END:VCALENDAR