Resource-constrained Shortest Path Problem

The Resource-Constrained Shortest Path Problem is a combinatorial optimization problem in graph theory that seeks a path of minimum cost between two nodes in a directed graph while satisfying constraints on limited resources associated with the traversal of edges and vertices.

83

Publications

5.3K

Citations

184

Authors

123

Institutions

Publications per year

2017–2026

28

Variants

Rcspp

Authors

184

  1. LD
    Luigi Di Puglia Pugliese

    University of Calabria, Italy

    6 publications · 254 citations

    6

    h-index

  2. FG
    Francesca Guerriero

    University of Calabria, Italy

    6 publications · 254 citations

    6

    h-index

  3. GD
    Guy Desaulniers

    Polytechnique Montréal, Canada

    5 publications · 305 citations

    5

    h-index

  4. SI
    Stefan Irnich

    Johannes Gutenberg University Mainz, Germany

    4 publications · 326 citations

    4

    h-index

  5. GR
    Giovanni Righini

    University of Milan, Italy

    4 publications · 757 citations

    4

    h-index

1–5 of 184

Venues

  1. Transportation Science

    11 publications · 1.1K citations

    11

    h-index

  2. Networks

    9 publications · 1.6K citations

    9

    h-index

  3. European Journal of Operational Research

    7 publications · 190 citations

    7

    h-index

  4. Computers & Operations Research

    4 publications · 100 citations

    4

    h-index

  5. INFORMS journal on computing

    4 publications · 274 citations

    4

    h-index

1–5