Two disjoint shortest paths problem with non-negative edge length.

Yusuke Kobayashi Ryo Sako

Published in: Oper. Res. Lett. (2019)

Keyphrases

geodesic distance
shortest path
weighted graph
path length
shortest path problem
minimum length
edge weights
road network
edge detection
shortest path algorithm
edge detector
strongly connected components
travel time
pairwise
minimal surface
minimum cost
minimum cost flow
reinforcement learning