Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function

[1]  Sumit Sarkar,et al.  A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems , 1996, Transp. Sci..

[2]  John N. Tsitsiklis,et al.  Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs , 1993, Oper. Res..

[3]  Patrick Jaillet,et al.  Shortest path problems with node failures , 1992, Networks.

[4]  Ishwar Murthy,et al.  Solving min‐max shortest‐path problems on a network , 1992 .

[5]  Gilbert Laporte,et al.  The Vehicle Routing Problem with Stochastic Travel Times , 1992, Transp. Sci..

[6]  Jonathan F. Bard,et al.  ARC reduction and path preference in stochastic acyclic networks , 1991 .

[7]  Mordechai I. Henig,et al.  Risk Criteria in a Stochastic Knapsack Problem , 1990, Oper. Res..

[8]  Thomas L. Morin,et al.  Generalized Dynamic Programming for Stochastic Combinatorial Optimization , 1989, Oper. Res..

[9]  Arthur Warburton,et al.  Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems , 1987, Oper. Res..

[10]  V. Adlakha.  Note-An Improved Conditional Monte Carlo Technique for the Stochastic Shortest Path Problem , 1986 .

[11]  Jonathan F. Bard,et al.  Parallel Funding of R&D Tasks with Probabilistic Outcomes , 1985 .

[12]  Jerzy Kamburowski,et al.  Technical Note - A Note on the Stochastic Shortest Route Problem , 1985, Oper. Res..

[13]  Jeffrey M. Jaffe,et al.  Algorithms for finding paths with multiple constraints , 1984, Networks.

[14]  Ronald Prescott Loui,et al.  Optimal paths in graphs with stochastic or multidimensional weights , 1983, Commun. ACM.

[15]  Hiroaki Ishii,et al.  Stochastic spanning tree problem , 1981, Discret. Appl. Math..

[16]  James J. Solberg,et al.  The Stochastic Shortest Route Problem , 1980, Oper. Res..

[17]  F. Glover,et al.  A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.

[18]  J. Croucher.  A note on the stochastic shortest‐route problem , 1978 .

[19]  H. Frank,et al.  Shortest Paths in Probabilistic Graphs , 1969, Oper. Res..

[20]  Dimitri P. Bertsekas,et al.  Linear network optimization - algorithms and codes , 1991 .

[21]  M. Desrochers,et al.  A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows , 1988 .

[22]  Hossein Soroush,et al.  Optimal paths in probabilistic networks: A case with temporary preferences , 1985, Comput. Oper. Res..