The most likely path on series-parallel networks

Networks

Volumn 58, Issue 1, 2011, Pages 68-80

  Reich, Daniel ^a,b   Lopes, Leo ^c,d  

^a UNIVERSIDAD ADOLFO IBÁÑEZ   (Chile)

^b UNIVERSITY OF ARIZONA   (United States)

^c MONASH UNIVERSITY   (Australia)

^d University of Arizona   (United States)

Author keywords

optimization under uncertainty; probability bounds; series parallel; shortest path

Indexed keywords

ANALYTICAL BOUNDS; COMPUTATIONAL STUDIES; COMPUTATIONAL TRACTABILITY; EXACT SOLUTION; NUMERICAL INTEGRATIONS; OPTIMAL SOLUTIONS; OPTIMALITY; OPTIMIZATION UNDER UNCERTAINTY; ORDINAL OPTIMIZATION; PATH PROBLEMS; PROBABILITY BOUNDS; SERIES-PARALLEL; SHORTEST PATH; STOCHASTIC SHORTEST PATH PROBLEM; STOCHASTIC SHORTEST PATHS; TEST NETWORK;

GRAPH THEORY; HEURISTIC METHODS; HEURISTIC PROGRAMMING; OPTIMIZATION; STOCHASTIC SYSTEMS; WIRELESS SENSOR NETWORKS;

DYNAMIC PROGRAMMING;

EID: 79960721262     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20416     Document Type: Article

References (29)

1. V. G. Adlakha, An improved conditional Monte Carlo technique for the stochastic shortest path problem, Manage Sci 32 (1986), 1360-1367.
2. C. Alexopoulos, State space partitioning methods for stochastic shortest path problems, Networks 30 (1997), 9-21. (Pubitemid 127360027)
3. J. F. Bard, J. E. Bennett, Arc reduction and path preference in stochastic acyclic networks, Manage Sci 37 (1991), 198-215.
4. J. F. Bard, J. L. Miller, Probabilistic shortest path problems with budgetary constraints, Comput Oper Res 16 (1989), 145-159.
5. D. Bertsimas, M. Sim, Robust discrete optimization and network flows, Math Program 98 (2003), 49-71.
6. H. Booth, R. E. Tarjan, Finding the minimum-cost maximum flow in a series-parallel network, J Algorithms 15 (1993), 416-446.
7. J. M. Burt Jr., M. B. Garman, Conditional Monte Carlo: A simulation technique for stochastic network analysis, Manage Sci 18 (1971), 207-217.
8. J. T. Chayes, A. Puha, T. Sweet, Independent and dependent percolation, Probability Theory Appl, IAS/Park City Math Ser 6 (1999), 51-118.
9. D. W. Coit, A. E. Smith, Reliability optimization of series-parallel systems using a genetic algorithm, IEEE Trans Reliab 45 (1996), 254-260.
10. W. J. Cook, W. H. Cunningham, W. R. Pulleyblank, A. Schrijver, Combinatorial Optimization, Wiley, New York, 1998.
11. A. Eiger, P. B. Mirchandani, H. Soroush, Path preferences and optimal paths in probabilistic networks, Transportation Sci 19 (1985), 75-84. (Pubitemid 15490001)
12. P. C. Fishburn, Utility theory, Manage Sci 14 (1968), 335-378.
13. C. M. Fortuin, P. W. Kasteleyn, J. Ginibre, Correlation inequalities on some partially ordered sets, Commun in Math Phys 22 (1971), 89-103.
14. H. Frank, Shortest paths in probabilistic graphs, Oper Res 17 (1969), 583-599.
15. W. Herroelen, R. Leus, Project scheduling under uncertainty: Survey and research potentials, Eur J Oper Res 165 (2005), 289-306. (Pubitemid 40206362)
16. Y. C. Ho, R. S. Sreenivas, P. Vakili, Ordinal optimization of DEDS, Discr Event Dynamic Syst 2 (1992), 61-88.
17. A. Kasperski, P. Zieliski, The robust shortest path problem in series-parallel multidigraphs with interval data, Oper Res Lett 34 (2006), 69-76. (Pubitemid 41688320)
18. B. Klinz, G. J. Woeginger, Minimum-cost dynamic flows: The series-parallel case, Networks 43 (2004), 153-162. (Pubitemid 38700753)
19. P. Kouvelis, G. Yu, Robust discrete optimization and its applications, Kluwer Academic Pub, The Netherlands, 1997.
20. R. P. Loui, Optimal paths in graphs with stochastic or multidimensional weights, Commun ACM 26 (1983), 670-676.
21. R. Montemanni, L. M. Gambardella, A. V. Donati, A branch and bound algorithm for the robust shortest path problem with interval data, Oper Res Lett 32 (2004), 225-232.
22. J. B. Sidney, The two-machine maximum flow time problem with series parallel precedence relations, Oper Res 27 (1979), 782-791.
23. C. E. Sigal, A. A. B. Pritsker, J. J. Solberg, The use of cutsets in Monte Carlo analysis of stochastic networks, Math Comput in Simulation 21 (1979), 376-384. (Pubitemid 10446036)
24. C. E. Sigal, A. A. B. Pritsker, J. J. Solberg, The stochastic shortest route problem, Oper Res 28 (1980), 1122-1129.
25. L. V. Tavares, A review of the contribution of operational research to project management, Eur J Oper Res 136 (2002), 1-18. (Pubitemid 33018800)
26. J. Valdes, R. E. Tarjan, E. L. Lawler, The recognition of series parallel digraphs, Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, Atlanta, Georgia, United States (1979), 1-12.
27. J. A. Ward, Minimum-aggregate-concave-cost multicommodity flows in strong series-parallel networks, Math Oper Res 24 (1999), 106-129.
28. G. Yu, J. Yang, On the robust shortest path problem, Comput Oper Res 25 (1998), 457-468.
29. P. Zieliski, The computational complexity of the relative robust shortest path problem with interval data, Eur J Oper Res 158 (2004), 570-576.