8 citations · 31 across the 20 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2015★ 1 cited
Algorithms for Non-Linear and Stochastic Resource Constrained Shortest Paths
Axel Parmentier
Resource constrained shortest path problems are usually solved thanks to a smart enumeration of all the non-dominated paths. Recent improvements of these enumeration algorithms rel…
cs.DS2014★ 7 cited
Stochastic Shortest Paths and Risk Measures
Axel Parmentier, Frédéric Meunier
We consider three shortest path problems in directed graphs with random arc lengths. For the first and the second problems, a risk measure is involved. While the first problem cons…