In this paper we propose a variational approach to the Steiner tree problem, which is based on calibrations in a suitable algebraic environment for polyhedral chains which represent our candidates. This approach turns out to be very efficient from numerical point of view and allows to establish whether a given Steiner tree is optimal. Several examples are provided.
Numerical Calibration of Steiner trees
Velichkov B.
2019-01-01
Abstract
In this paper we propose a variational approach to the Steiner tree problem, which is based on calibrations in a suitable algebraic environment for polyhedral chains which represent our candidates. This approach turns out to be very efficient from numerical point of view and allows to establish whether a given Steiner tree is optimal. Several examples are provided.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Massaccesi2019_Article_NumericalCalibrationOfSteinerT.pdf
solo utenti autorizzati
Tipologia:
Versione finale editoriale
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
7.31 MB
Formato
Adobe PDF
|
7.31 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
|
MOV.pdf
accesso aperto
Tipologia:
Documento in Pre-print
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
15.9 MB
Formato
Adobe PDF
|
15.9 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
