New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems

By V. N. Sastry   T. N. Janakiraman   S. Ismail Mohideen  

International Journal of Computer Mathematics, Vol. 82, Iss. 3, 2005-03 ,pp. : 289-300

Taylor & Francis Ltd

Access to resources Recommend Favorite

Parallel Asynchronous Algorithms for the K Shortest Paths Problem

By Guerriero F.   Musmanno R.  

Journal of Optimization Theory and Applications, Vol. 104, Iss. 1, 2000-01 ,pp. : 91-108

Springer Publishing Company

Access to resources Recommend Favorite

The Analysis of Evolutionary Algorithms on Sorting and Shortest Paths Problems: Evolutionary Computation Combinatorial Optimization (Editors: Jens Gottlieb, Emma Hart, Martin Middendorf, Günter Raidl and Colin Reeves)

By Scharnow Jens   Tinnefeld Karsten   Wegener Ingo  

Journal of Mathematical Modelling and Algorithms, Vol. 3, Iss. 4, 2004-01 ,pp. : 349-366

Springer Publishing Company

Access to resources Recommend Favorite

Floats, Integers, and Single Source Shortest Paths

By Thorup M.  

Journal of Algorithms, Vol. 35, Iss. 2, 2000-05 ,pp. : 189-201

Academic Press

Access to resources Recommend Favorite

Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition

By Cohen E.  

Journal of Algorithms, Vol. 21, Iss. 2, 1996-09 ,pp. : 331-357

Academic Press

Access to resources Recommend Favorite