Volume 21 (2023)
Volume 20 (2022)
Volume 19 (2021)
Volume 18 (2020)
Volume 17 (2019)
Volume 16 (2018)
Volume 15 (2017)
Volume 14 (2016)
Volume 13 (2015)
Volume 12 (2015)
Volume 11 (2014)
Volume 9 (2012)
Volume 10 (2012)
Volume 8 (2010)
Volume 6 (2007)
Volume 5 (2006)
Volume 4 (2006)
Volume 3 (2005)
Volume 2 (2004)
Volume 1 (2003)
An Algorithm for the Cycled Shortest Path Problem

Asghar Aini; Amir Salehipour

Volume 8, Issue 21 , June 2011, , Pages 167-180

Abstract
  For a network with cycle, where at least one cycle exists, the Floyd- Warshall algorithm is probably the most used algorithm to determine he least cost path between every pair of nodes on this network, i.e. the solution for the shortest path problem with cycle. In this paper, a new algorithm for this ...  Read More