Mathematical Programming

, Volume 73, Issue 2, pp 129–174

Shortest paths algorithms: Theory and experimental evaluation

  • Boris V. Cherkassky
  • Andrew V. Goldberg
  • Tomasz Radzik
Article

DOI: 10.1007/BF02592101

Cite this article as:
Cherkassky, B.V., Goldberg, A.V. & Radzik, T. Mathematical Programming (1996) 73: 129. doi:10.1007/BF02592101

Abstract

We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study is based on several natural problem classes which identify strengths and weaknesses of various algorithms. These problem classes and algorithm implementations form an environment for testing the performance of shortest paths algorithms. The interaction between the experimental evaluation of algorithm behavior and the theoretical analysis of algorithm performance plays an important role in our research.

Keywords

Graph algorithms Network optimization Shortest paths Theory and experimental evaluation of algorithms 

Copyright information

© The Mathematical Programming Society, Inc. 1996

Authors and Affiliations

  • Boris V. Cherkassky
    • 1
  • Andrew V. Goldberg
    • 2
  • Tomasz Radzik
    • 3
  1. 1.Central Institute for Economics and MathematicsMoscowRussia
  2. 2.Computer Science DepartmentStanford UniversityStanfordUSA
  3. 3.Department of Computer ScienceKing's College LondonLondonUK
  4. 4.NEC Research InstitutePrinceton

Personalised recommendations