Please use this identifier to cite or link to this item: http://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: http://hdl.handle.net/10316/7763 DOI: 10.1007/s10288-002-0010-2 Rights: openAccess 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

95
checked on Jul 2, 2021

#### Page view(s) 50

383
checked on Jul 29, 2021

519
checked on Jul 29, 2021