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:20121028T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20130331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.6472.field_data.0@www.open.diag.uniroma1.it
DTSTAMP:20260407T211904Z
CREATED:20121221T190113Z
DESCRIPTION:Title: Separable non-convex underestimators for binary quadrati
 c programmingWe present a new approach to constrained quadratic binary pro
 gramming. Dual bounds are computed by choosing appropriate global underest
 imators of the objective function that are separable but not necessarily c
 onvex. Using the binary constraint on the variables\, the minimization of 
 this separable underestimator can be reduced to a linear minimization prob
 lem over the same set of feasible vectors. For most combinatorial optimiza
 tion problems\, the linear version is considerably easier than the quadrat
 ic version. We explain how to embed this approach into a branch-and-bound 
 algorithm and present experimental results.
DTSTART;TZID=Europe/Paris:20121220T150000
DTEND;TZID=Europe/Paris:20121220T150000
LAST-MODIFIED:20191008T084958Z
LOCATION:Aula A5@DIAG\, Via Ariosto 25
SUMMARY:MORE@diag Seminar: Emiliano Traversi - Emiliano Traversi\,  Fakulta
 et fur Mathematik\, TU Dortmund\,
URL;TYPE=URI:http://www.open.diag.uniroma1.it/node/6472
END:VEVENT
END:VCALENDAR