BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20251124T164032EST-1244jVpznV@132.216.98.100
DTSTAMP:20251124T214032Z
DESCRIPTION:Title: The challenging Euclidean Steiner Tree Problem.\n\nAbstr
 act: The Euclidean Steiner Tree Problem (ESTP) asks for a network of minim
 um length interconnecting a given set of points in n-dimensional space.  W
 e present well known geometric properties of the optimal solution of the E
 STP and discuss their application in the development of solution methods. 
 We focus on mixed integer nonlinear programming (MINLP) formulations and b
 ranch-and-bound algorithms\, identifying characteristics of the problem th
 at make it a big challenge in optimization\, particularly when n is greate
 r than 2. Finally\, we investigate what can still be done to improve our a
 bility to solve this problem in the broader context of MINLP.\n
DTSTART:20191029T193000Z
DTEND:20191029T213000Z
LOCATION:Room 5340\, CA\, Pav. André-Aisenstadt
SUMMARY:Marcia Fampa\, Universidade Federal do Rio de Janeiro
URL:/mathstat/channels/event/marcia-fampa-universidade
 -federal-do-rio-de-janeiro-302026
END:VEVENT
END:VCALENDAR