Constrained Shortest Paths

Constrained Shortest Paths is a shortest path problem variant in which the solution path must satisfy additional constraints beyond minimizing total cost, such as limited resources, quality-of-service requirements, or cumulative bounds on auxiliary metrics.

222

Publications

14.9K

Citations

487

Authors

264

Institutions

Publications per year

2017–2026

47

Authors

487

  1. FG
    Francesca Guerriero

    University of Calabria, Italy

    7 publications · 295 citations

    7

    h-index

  2. TK
    Turgay Korkmaz

    The University of Texas at San Antonio, United States

    5 publications · 523 citations

    5

    h-index

  3. GX
    Guoliang Xue

    Arizona State University, United States

    5 publications · 135 citations

    5

    h-index

  4. MK
    Marwan Krunz

    University of Arizona, United States

    5 publications · 523 citations

    5

    h-index

  5. LD
    Luigi Di Puglia Pugliese

    University of Calabria, Italy

    5 publications · 225 citations

    5

    h-index

1–5 of 487

Venues

  1. Networks

    15 publications · 2.1K citations

    15

    h-index

  2. Computers & Operations Research

    13 publications · 654 citations

    12

    h-index

  3. European Journal of Operational Research

    8 publications · 248 citations

    8

    h-index

  4. Transportation Science

    8 publications · 488 citations

    8

    h-index

  5. Proceedings of the VLDB Endowment

    PVLDB · 5 publications · 244 citations

    5

    h-index

1–5