We survey some recent results on convex relaxations and a variational approximation for the classical Euclidean Steiner tree problem and we see how these new perspectives can lead to effective numerical schemes for the identification of Steiner minimal trees.
Convex relaxation and variational approximation of the Steiner problem: theory and numerics
M. Bonafini
2018-01-01
Abstract
We survey some recent results on convex relaxations and a variational approximation for the classical Euclidean Steiner tree problem and we see how these new perspectives can lead to effective numerical schemes for the identification of Steiner minimal trees.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
