EnglishThe K shortest paths problem has been extensively studied for many years. Efficient methods have been devised, and many practical applications are known. Shortest hyperpath models have been proposed for several problems in different areas, for example in relation with routing in dynamic networks. However, the K shortest hyperpaths problem has not yet been investigated.In this paper we present procedures for finding the K shortest hyperpaths in a directed hypergraph. This is done by extending existing algorithms for K shortest loopless paths. Computational experiments on the proposed procedures are performed, and applications in transportation, planning and combinatorial optimization are discussed.
Finding the K shortest hyperpaths / K. A., Andersen; L. R., Nielsen; Pretolani, Daniele. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - STAMPA. - 32 No.6(2005), pp. 1477-1497.
| Data di pubblicazione: | 2005 | |
| Titolo: | Finding the K shortest hyperpaths | |
| Autore/i: | K. A., Andersen; L. R., Nielsen; Pretolani, Daniele | |
| Autore/i UNIMORE: | ||
| Rivista: | ||
| Volume: | 32 No.6 | |
| Pagina iniziale: | 1477 | |
| Pagina finale: | 1497 | |
| Codice identificativo ISI: | WOS:000225907500006 | |
| Codice identificativo Scopus: | 2-s2.0-9544231685 | |
| Citazione: | Finding the K shortest hyperpaths / K. A., Andersen; L. R., Nielsen; Pretolani, Daniele. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - STAMPA. - 32 No.6(2005), pp. 1477-1497. | |
| Tipologia | Articolo su rivista |
File in questo prodotto:
| File | Descrizione | Tipologia | |
|---|---|---|---|
| KSBT-CaOR.pdf | Post-print dell'autore (bozza post referaggio) | Administrator Richiedi una copia |
Pubblicazioni consigliate
http://hdl.handle.net/11380/457155
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
Copyright © 2021