Please use this identifier to cite or link to this item: http://hdl.handle.net/10316/7763
DC FieldValueLanguage
dc.contributor.authorMartins, Ernesto Q. V.-
dc.contributor.authorPascoal, Marta M. B.-
dc.date.accessioned2009-02-17T11:18:10Z-
dc.date.available2009-02-17T11:18:10Z-
dc.date.issued2003en_US
dc.identifier.citation4OR: A Quarterly Journal of Operations Research. 1:2 (2003) 121-133en_US
dc.identifier.urihttp://hdl.handle.net/10316/7763-
dc.description.abstractYen’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.isoengeng
dc.rightsopenAccesseng
dc.titleA new implementation of Yen’s ranking loopless paths algorithmen_US
dc.typearticleen_US
dc.identifier.doi10.1007/s10288-002-0010-2en_US
item.fulltextCom Texto completo-
item.grantfulltextopen-
item.languageiso639-1en-
crisitem.author.deptFaculty of Sciences and Technology-
crisitem.author.parentdeptUniversity of Coimbra-
crisitem.author.researchunitCMUC - Centre for Mathematics of the University of Coimbra-
crisitem.author.orcid0000-0003-0517-677X-
Appears in Collections:FCTUC Matemática - Artigos em Revistas Internacionais
###### Files in This Item:
File Description SizeFormat

#### SCOPUSTM Citations

173
checked on Feb 18, 2020

#### WEB OF SCIENCETM Citations 1

99
checked on Sep 2, 2021

#### Page view(s) 50

389
checked on Sep 16, 2021

535
checked on Sep 16, 2021