Stochastic shortest path problems with piecewise-linear concave utility functions

Management Science

Volumn 44, Issue 11 PART 2, 1998, Pages

  Murthy, Ishwar ^a   Sarkar, Sumit ^a  

^a NONE

Author keywords

Networks; Shortest Path; Stochastic

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BENCHMARKING; FUNCTIONS; NORMAL DISTRIBUTION; OPTIMIZATION; PERT; PIECEWISE LINEAR TECHNIQUES; PROBLEM SOLVING; RANDOM PROCESSES;

PIECEWISE-LINEAR CONCAVE UTILITY FUNCTIONS; STOCHASTIC SHORTEST PATHS;

CRITICAL PATH ANALYSIS;

EID: 0032207880     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.44.11.s125     Document Type: Article

References (16)

1. Bard, J. F., J. E. Bennett. 1991. Arc reduction and path preference in stochastic acyclic networks. Management Sci. 37 198-215.
2. Bodily, S. E. 1985. Modern Decision Making: A Guide to Modeling with Decision Support Systems, McGraw-Hill, New York.
3. Brown, M. 1991. A mean-variance serial replacement decision model: the independent case, Technical Report 91-38, Department of Industrial and Operations Engineering, College of Engineering, The University of Michigan, Ann Arbor, MI.
4. Carraway, R. L., T. L. Morin, H. Moskowitz. 1988. Generalized dynamic programming for multicriteria optimization. European J. Oper. Res. 44 95-104.
5. Chand, S. S. Sethi. 1982. Planning horizon procedures for machine replacement models with several possible alternatives. Naval Res. Logistics Quarterly 29 483-493.
6. Denardo, E. V. 1982. Dynamic Programming: Models and Applications. Prentice-Hall, Englewood Cliffs, NJ.
7. Desrochers, M., F. Soumis. 1988. A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR 26 193-203.
8. Dial, R., F. Glover, D. Karney, D. Klingman. 1979. A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees. Networks 9 215-248.
9. Karabakal, N., J. R. Lohmann, J. C. Bean. 1994. Parallel replacement under capital rationing constraints. Management Sci. 40 305-319.
10. Loui, R. P. 1983. Optimal paths in graphs with stochastic or multidimensional weights. Comm. ACM 26 670-676.
11. Mirchandani, P. B., H. Soroush. 1985. Optimal paths in probabilistic networks: a case with temporary preferences. Computers and Operations Res. 12 365-383.
12. Murthy, I., S-S. Her. 1992. Solving min-max shortest-path problems on a network. Naval Res. Logistics 39 669-683.
13. _, S. Sarkar, 1995. Stochastic shortest path dynamic programming models with piecewise-linear concave utility functions. Working Paper, Department of ISDS, Louisiana State University.
14. _ and _. 1996. A relaxation-based pruning technique for a class of stochastic shortest path problems. Trans. Sci. 30(3) 220-236.
15. Stewart, B. S., C. C. White III. 1991. Multiobjective A*. J. Assoc. Computing Machinery 38(4) 775-814.
16. Vincke, P. 1974. Problemes multicriteres. Cahiers Centre Études Rech. Opér. 16 425-439.