Login / Signup
A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs.
Troels Martin Range
Dawid Kozlowski
Niels Christian Petersen
Published in:
Comput. Oper. Res. (2018)
Keyphrases
</>
shortest path
shortest path problem
road network
shortest path algorithm
routing algorithm
path length
dijkstra algorithm
optimal path
flow graph
weighted graph
shortest distance
minimal surface
strongly connected components
geodesic distance
edge weights