Probabilistic shortest path problems with budgetary constraints

DOI10.1016/0305-0548(89)90016-6zbMath0661.90090OpenAlexW2046265805MaRDI 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

communicationtransportationsimulationapproximate solutionsproject selectionexpected utilityconstrained shortest path problemscomputer systems designrandom arc length

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (3)

Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios ⋮ Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem ⋮ The most likely path on series-parallel networks

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

This page was built for publication: Probabilistic shortest path problems with budgetary constraints