Optimal Path Routing
Optimal Path Routing is a methodological framework within spatial analysis that determines the most efficient trajectory between locations by minimizing cumulative travel cost, distinguished from other routing approaches through its reliance on least-cost path algorithms grounded in graph theory and surface modeling.
335
Publications
14.1K
Citations
950
Authors
483
Institutions
Publications per year
2017–2026
147
Parents
335
Richard Bellman · Quarterly of Applied Mathematics · 1958 · 2.7K citations · Full text
A scalable solution to minimum cost forwarding in large sensor networks
Fan Ye, Andre Chen, Songwu Lu et al. · 2002 · 413 citations
1–5 of 335
950
4
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 950
483
Vellore Institute of Technology University
Vellore, India
6 h-index
15 publications
777 citations
National Taiwan Ocean University
Keelung, Taiwan
4 h-index
7 publications
313 citations
Michigan State University
East Lansing, United States
4 h-index
6 publications
442 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
9 publications
141 citations
Texas A&M University
College Station, United States
4 h-index
7 publications
186 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
4 h-index
4 publications
118 citations
Kumoh National Institute of Technology
Gumi, South Korea
3 h-index
7 publications
388 citations
University of Pennsylvania
Philadelphia, United States
3 h-index
4 publications
347 citations
1–8 of 483
9 publications · 463 citations
10
h-index
6 publications · 167 citations
6
h-index
4 publications · 166 citations
4
h-index
4 publications · 148 citations
4
h-index
3 publications · 178 citations
3
h-index
1–5