Probabilistic shortest path problems with budgetary constraints

DOI10.1016/0305-0548(89)90016-6zbMath0661.90090MaRDI QIDQ1113810

Jonathan F. Bard, Jeanne L. Miller

Publication date: 1989

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(89)90016-6

zbMATH Keywords

communication; transportation; simulation; approximate solutions; project selection; expected utility; constrained shortest path problems; computer systems design; random arc length

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

65K05: Numerical mathematical programming methods

90B15: Stochastic network models in operations research

90B35: Deterministic scheduling theory in operations research

90C39: Dynamic programming

Related Items

Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal paths in graphs with stochastic or multidimensional weights
• Estimating Network Characteristics in Stochastic Activity Networks
• Approximating the Criticality Indices of the Activities in PERT Networks
• The Stochastic Shortest Route Problem
• Technical Note—Shortest-Path Algorithms: A Comparison
• Distribution of the Time Through a Directed, Acyclic Network
• Bounding Distributions for a Stochastic Acyclic Network