Stochastic Shortest Path Problems with Piecewise-Linear Concave Utility Functions

References

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