We present some reoptimization techniques for computing (shortest) hyperpath weights in a directed hypergraph.These techniques are exploited to improve the worst-case computational complexity (as well as the practical performance) of an algorithm finding the K shortest hyperpaths in acyclic hypergraphs.
Finding the K shortest hyperpaths using reoptimization / K. A., Andersen; L. R., Nielsen; Pretolani, Daniele. - In: OPERATIONS RESEARCH LETTERS. - ISSN 0167-6377. - STAMPA. - 34:2(2006), pp. 155-164. [10.1016/j.orl.2005.04.008]
Finding the K shortest hyperpaths using reoptimization
PRETOLANI, Daniele
2006
Abstract
We present some reoptimization techniques for computing (shortest) hyperpath weights in a directed hypergraph.These techniques are exploited to improve the worst-case computational complexity (as well as the practical performance) of an algorithm finding the K shortest hyperpaths in acyclic hypergraphs.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
