Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/7763
Title: | A new implementation of Yen’s ranking loopless paths algorithm | Authors: | Martins, Ernesto Q. V. Pascoal, Marta M. B. |
Issue Date: | 2003 | Citation: | 4OR: A Quarterly Journal of Operations Research. 1:2 (2003) 121-133 | Abstract: | Yen’s algorithm is a classical algorithm for ranking the K shortest loopless paths between a pair of nodes in a network. In this paper an implementation of Yen’s algorithm is presented. Both the original algorithm and this implementation present ${\cal O}(Kn(m + n\log n))$ computational complexity order when considering a worst-case analysis. However, computational experiments are reported, which allow to conclude that in practice this new implementation outperforms two other, Perko’s implementation and a straightforward one. | URI: | https://hdl.handle.net/10316/7763 | DOI: | 10.1007/s10288-002-0010-2 | Rights: | openAccess |
Appears in Collections: | FCTUC Matemática - Artigos em Revistas Internacionais |
Show full item record
SCOPUSTM
Citations
230
checked on Sep 16, 2024
WEB OF SCIENCETM
Citations
1
125
checked on Sep 2, 2024
Page view(s) 50
500
checked on Sep 10, 2024
Download(s) 50
865
checked on Sep 10, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.