Reoptimizing shortest paths consists in solving a sequence of shortest path problems, where each problem differs only slightly from the previous one, because the origin node has been changed, some arcs have been removed from the graph, or the cost of a subset of arcs has been modified.
Reoptimizing shortest paths: From state of the art to new recent perspectives / Ferone, Daniele; Festa, Paola; Napoletano, Antonio; Pastore, Tommaso. - 2016-:(2016), pp. 1-5. (Intervento presentato al convegno 18th International Conference on Transparent Optical Networks, ICTON 2016 tenutosi a ita nel 2016) [10.1109/ICTON.2016.7550605].
Reoptimizing shortest paths: From state of the art to new recent perspectives
FERONE, DANIELE;FESTA, PAOLA;NAPOLETANO, ANTONIO;PASTORE, TOMMASO
2016
Abstract
Reoptimizing shortest paths consists in solving a sequence of shortest path problems, where each problem differs only slightly from the previous one, because the origin node has been changed, some arcs have been removed from the graph, or the cost of a subset of arcs has been modified.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.
