An Analysis of Stochastic Shortest Path Problems [PDF]
Mathematics of Operations Research, 1991 We consider a stochastic version of the classical shortest path problem whereby for each node of a graph, we must choose a probability distribution over the set of successor nodes so as to reach a certain destination node with minimum expected cost. The costs of transition between successive nodes can be positive as well as negative.
Dimitri Bertsekas +1 more
exaly +3 more sources
A comparison of solution strategies for biobjective shortest path problems
Computers and Operations Research, 2009Andrea Raith, Matthias Ehrgott
exaly
An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints
Transportation Science, 2016Leonardo Lozano +2 more
exaly
Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment
Applied Soft Computing Journal, 2012Yong Deng +2 more
exaly
A branch and bound algorithm for the robust shortest path problem with interval data
Operations Research Letters, 2004Roberto Montemanni, L M Gambardella
exaly
On an instance of the inverse shortest paths problem
Mathematical Programming, 1992Philippe Toint
exaly
An ant colony optimization algorithm for the bi-objective shortest path problem
Applied Soft Computing Journal, 2010Keivan Ghoseiri
exaly
A shortest augmenting path algorithm for dense and sparse linear assignment problems
Computing (Vienna/New York), 1987A Volgenant
exaly
Multi-objective and multi-constrained non-additive shortest path problems
Computers and Operations Research, 2011David Pisinger, Line Blander Reinhardt
exaly
Dynamic programming approaches to solve the shortest path problem with forbidden paths
Optimization Methods and Software, 2013Francesca Guerriero +1 more
exaly