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.18196.field_data.0@www.diag.uniroma1.it
DTSTAMP:20260311T225551Z
CREATED:20190604T184411Z
DESCRIPTION:In this talk we present a dynamic inequality generation scheme 
 to generate valid polynomial inequalities for binary polynomial programs. 
 When used iteratively\, this scheme improves the bounds without incurring 
 an exponential growth in the size of the relaxation. As a result\, the pro
 posed scheme is in principle scalable to large binary polynomial programmi
 ng problems. We show special cases for which the proposed scheme converges
  to the global optimal solution. We also present several examples illustra
 ting the computational behavior of the scheme and provide comparisons with
  Lasserre’s approach and with the lift-and-project method of Balas\, Ceria
 \, and Cornuéjols.
DTSTART;TZID=Europe/Paris:20190611T113000
DTEND;TZID=Europe/Paris:20190611T113000
LAST-MODIFIED:20200723T170625Z
LOCATION:Aula A4 - DIAG
SUMMARY:A cut generation scheme for binary polynomial optimization problems
  - Bissan Ghaddar
URL;TYPE=URI:https://www.diag.uniroma1.it/node/18196
END:VEVENT
END:VCALENDAR