Randomized shortest paths with net flows and capacity constraints.

Sylvain Courtain Pierre Leleux Ilkka Kivimäki Guillaume Guex Marco Saerens

Published in: Inf. Sci. (2021)

Keyphrases

shortest path
capacity constraints
lagrangian relaxation
network flow
shortest path problem
minimum cost
bicriteria
shortest path algorithm
road network
travel time
finding the shortest path
lower bound
single item
approximation algorithms