Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/7763
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Martins, Ernesto Q. V. | - |
dc.contributor.author | Pascoal, Marta M. B. | - |
dc.date.accessioned | 2009-02-17T11:18:10Z | - |
dc.date.available | 2009-02-17T11:18:10Z | - |
dc.date.issued | 2003 | en_US |
dc.identifier.citation | 4OR: A Quarterly Journal of Operations Research. 1:2 (2003) 121-133 | en_US |
dc.identifier.uri | https://hdl.handle.net/10316/7763 | - |
dc.description.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. | en_US |
dc.language.iso | eng | eng |
dc.rights | openAccess | eng |
dc.title | A new implementation of Yen’s ranking loopless paths algorithm | en_US |
dc.type | article | en_US |
dc.identifier.doi | 10.1007/s10288-002-0010-2 | en_US |
item.fulltext | Com Texto completo | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.languageiso639-1 | en | - |
item.openairetype | article | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | open | - |
crisitem.author.researchunit | CMUC - Centre for Mathematics of the University of Coimbra | - |
crisitem.author.orcid | 0000-0003-0517-677X | - |
Appears in Collections: | FCTUC Matemática - Artigos em Revistas Internacionais |
SCOPUSTM
Citations
232
checked on Oct 14, 2024
WEB OF SCIENCETM
Citations
1
125
checked on Oct 2, 2024
Page view(s) 50
507
checked on Oct 22, 2024
Download(s) 50
881
checked on Oct 22, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.