Event
Marcia Fampa, Universidade Federal do Rio de Janeiro
Title:聽The challenging Euclidean Steiner Tree Problem.
Abstract:聽The Euclidean Steiner Tree Problem (ESTP) asks for a network of minimum length interconnecting a given set of points in n-dimensional space.聽 We present well known geometric properties of the optimal solution of the ESTP and discuss their application in the development of solution methods. We focus on mixed integer nonlinear programming (MINLP) formulations and branch-and-bound algorithms, identifying characteristics of the problem that make it a big challenge in optimization, particularly when n is greater than 2. Finally, we investigate what can still be done to improve our ability to solve this problem in the broader context of MINLP.