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
Parents
83
An algorithm for the resource constrained shortest path problem
J. E. Beasley, N.D. Christofides · Networks · 1989 · 317 citations
1–5 of 83
184
6
h-index
6
h-index
5
h-index
4
h-index
4
h-index
1–5 of 184
123

Polytechnique Montréal
Montreal, Canada
9 h-index
13 publications
798 citations
Group for Research in Decision Analysis
Montreal, Canada
7 h-index
12 publications
1K citations

University of Calabria
Rende, Italy
6 h-index
12 publications
508 citations

Centre National de la Recherche Scientifique
Paris, France
5 h-index
9 publications
139 citations

University of Milan
Milan, Italy
4 h-index
9 publications
1.6K citations
Texas A&M University
College Station, United States
3 h-index
4 publications
93 citations
HEC Montréal
Montreal, Canada
3 h-index
4 publications
403 citations
Johannes Gutenberg University Mainz
Mainz, Germany
3 h-index
9 publications
380 citations
1–8 of 123
11 publications · 1.1K citations
11
h-index
9 publications · 1.6K citations
9
h-index
7 publications · 190 citations
7
h-index
4 publications · 100 citations
4
h-index
4 publications · 274 citations
4
h-index
1–5