Shortest Path Problems

Shortest Path Problems is a fundamental optimization problem in network theory that seeks to determine the path between two nodes in a graph such that the sum of the weights of its constituent edges is minimized.

2.3K

Publications

167K

Citations

4.5K

Authors

1.4K

Institutions

Publications per year

2017–2026

394

Variants

Shortest Path Problem

Authors

4.5K

  1. SB
    Said Broumi

    University of Hassan II Casablanca, Morocco

    18 publications · 671 citations

    14

    h-index

  2. JH
    John Hershberger

    Stanford University, United States

    15 publications · 1.9K citations

    14

    h-index

  3. FG
    Francesca Guerriero

    University of Calabria, Italy

    15 publications · 626 citations

    14

    h-index

  4. JB
    James B. Orlin

    Massachusetts Institute of Technology, United States

    14 publications · 2K citations

    13

    h-index

  5. DP
    Dimitri P. Bertsekas

    Massachusetts Institute of Technology, United States

    13 publications · 1.7K citations

    12

    h-index

1–5 of 4.5K

Venues

  1. Networks

    103 publications · 11.8K citations

    49

    h-index

  2. European Journal of Operational Research

    71 publications · 4.4K citations

    37

    h-index

  3. Computers & Operations Research

    53 publications · 3.6K citations

    34

    h-index

  4. SIAM Journal on Computing

    46 publications · 5.4K citations

    32

    h-index

  5. Operations Research

    43 publications · 6.7K citations

    31

    h-index

1–5