Extended dominance and a stochastic shortest path problem

Computers and Operations Research

Volumn 36, Issue 2, 2009, Pages 584-596

  Hutson, Kevin R ^a   Shier, Douglas R ^b  

^a FURMAN UNIVERSITY   (United States)

^b CLEMSON UNIVERSITY   (United States)

Author keywords

Bicriterion shortest paths; Dominance; Efficiency; Labeling algorithms; Pareto optimality; Stochastic shortest paths

Indexed keywords

LABELS; STANDARDS; STOCHASTIC PROGRAMMING;

BICRITERION SHORTEST PATHS; COMPUTATION TIME; CONCAVE FUNCTIONS; CONVEX FUNCTION; DOMINANCE; EFFICIENCY; LABELING ALGORITHMS; OBJECTIVE FUNCTION; OPTIMALITY; OPTIMALITY PRINCIPLES; PARETO OPTIMALITY; STANDARD FORM; STOCHASTIC NETWORKS; STOCHASTIC SHORTEST PATH PROBLEM; STOCHASTIC SHORTEST PATHS; STORAGE REQUIREMENTS; TEST RESULTS;

LABELING;

EID: 52049106199     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2007.10.016     Document Type: Article

References (16)

1. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network flows: theory, algorithms, and applications (1993), Prentice-Hall, Upper Saddle River (NJ)
2. Hung M.S., and Divoky J.J. A computational study of efficient shortest path algorithms. Computers & Operations Research 15 (1988) 567-576
3. Mondou J.F., Crainic T.G., and Nguyen S. Shortest path algorithms: a computational study with the C programming language. Computers & Operations Research 18 (1991) 767-786
4. Ball M.O., Colbourn C.J., and Provan J.S. Network reliability. In: Ball M.O., Magnanti T.L., Monma C.L., and Nemhauser G.L. (Eds). Handbooks in operations research and management science vol. 7 (1995), Elsevier, Amsterdam 673-762
5. Hagstrom J. Computational complexity of PERT problems. Networks 18 (1988) 139-147
6. Bard J.F., and Bennett J.E. Arc reduction and path preference in stochastic acyclic networks. Management Science 37 (1991) 198-215
7. Mirchandani P.B., and Soroush H. Optimal paths in probabilistic networks: a case with temporary preferences. Computers & Operations Research 12 (1985) 365-381
8. Murthy I., and Sarkar S. A relaxation-based pruning technique for a class of stochastic shortest path problems. Transportation Science 30 (1996) 220-236
9. Loui R.P. Optimal paths in graphs with stochastic or multidimensional weights. Communications of the ACM 26 (1983) 670-676
10. Chow Y.S., and Teicher H. Probability theory: independence, interchangeability, martingales (1997), Springer, New York (NY)
11. Brumbaugh-Smith J., and Shier D. An empirical investigation of some bicriterion shortest path algorithms. European Journal of Operational Research 43 (1989) 216-224
12. Hansen P. Bicriterion path problems. In: Fandel G., and Gal T. (Eds). Multiple criteria decision making: theory and application. Lecture Notes in Economics and Mathematical Systems vol. 177 (1980), Springer, Berlin 109-127
13. Mote J., Murty I., and Olson D.L. A parametric approach to solving bicriterion shortest path problems. European Journal of Operational Research 53 (1991) 81-92
14. Skriver A.J.V., and Andersen K.A. A label-correcting approach for solving bicriterion shortest path problems. Computers & Operations Research 27 (2000) 507-524
15. Fulkerson D.R. Expected critical path lengths in PERT networks. Operations Research 10 (1962) 808-817
16. Kulkarni V.G., and Adlakha V.G. Markov and Markov-regenerative PERT networks. Operations Research 34 (1986) 769-781