Bard, Jonathan F.; Bennett, James E. - In: Management Science 37 (1991) 2, pp. 198-215
The paper presents a heuristic for determining the path that maximizes the expected utility of a stochastic acyclic network. The focus is on shortest route problems where a general, nonlinear utility function is used to measure outcomes. For such problems, enumerating all feasible paths is the...