Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
On the Average Number of Maxima in a Set of Vectors and Applications
Journal of the ACM (JACM)
Multidimensional divide-and-conquer
Communications of the ACM
Communications of the ACM - Special issue: computing in the frontiers of science and engineering
Bandwidth-delay constrained path selection under inaccurate state information
IEEE/ACM Transactions on Networking (TON)
Freight simulation: dynamic freight traffic simulation providing real-time information
Proceedings of the 35th conference on Winter simulation: driving innovation
A Concept of Communication Distance and Its Application to Six Situations in Mobile Environments
IEEE Transactions on Mobile Computing
An exact algorithm for the statistical shortest path problem
ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
Stochastic shortest paths via Quasi-convex maximization
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Extended dominance and a stochastic shortest path problem
Computers and Operations Research
Solving Stochastic Path Problem: Particle Swarm Optimization Approach
IEA/AIE '08 Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence
Functional value iteration for decision-theoretic planning with general utility functions
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
A new approach to multiobjective A* search
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Shortest paths in stochastic networks with correlated link costs
Computers & Mathematics with Applications
International Journal of Applied Mathematics and Computer Science
Probabilistic path queries in road networks: traffic uncertainty aware path selection
Proceedings of the 13th International Conference on Extending Database Technology
Multiobjective A* search with consistent heuristics
Journal of the ACM (JACM)
Expert Systems with Applications: An International Journal
Fast routing in very large public transportation networks using transfer patterns
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Dynamic routing under recurrent and non-recurrent congestion using real-time ITS information
Computers and Operations Research
Shortest path problem with uncertain arc lengths
Computers & Mathematics with Applications
Path planning under time-dependent uncertainty
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Optimal factory scheduling using stochastic dominance A
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
High-Performance heuristics for optimization in stochastic traffic engineering problems
LSSC'09 Proceedings of the 7th international conference on Large-Scale Scientific Computing
On constrained Markov decision processes
Operations Research Letters
Computers and Operations Research
| Hi-index | 48.22 |
This paper explores computationally tractable formulations of stochastic and multidimensional optimal path problems, each as an extension of the shortest path problem. A single formulation encompassing both problems is considered, in which a utility function defines preference among candidate paths. The result is the ability to state explicit conditions for exact solutions using standard methods, and the applicability of well-understood approximation techniques.