Utilize este identificador para referenciar este registo:
https://hdl.handle.net/10316/7763
Campo DC | Valor | Idioma |
---|---|---|
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 | - |
Aparece nas coleções: | FCTUC Matemática - Artigos em Revistas Internacionais |
Citações SCOPUSTM
232
Visto em 14/out/2024
Citações WEB OF SCIENCETM
1
125
Visto em 2/out/2024
Visualizações de página 50
504
Visto em 15/out/2024
Downloads 50
879
Visto em 15/out/2024
Google ScholarTM
Verificar
Altmetric
Altmetric
Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.