Shortest path problems with node failures

DOI10.1002/net.3230220607zbMath0766.90031OpenAlexW2085725603MaRDI QIDQ4021823

Patrick Jaillet

Publication date: 17 January 1993

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230220607

zbMATH Keywords

shortest pathNP-hardminimum spanning treestochastic graphnode failures

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (11)

A survey on combinatorial optimization in dynamic environments ⋮ Probabilistic combinatorial optimization problems on graphs: A new domain in operational research ⋮ The probabilistic minimum dominating set problem ⋮ On the probabilistic min spanning tree problem ⋮ Finding the shortest path in stochastic networks ⋮ Dynamic journeying under uncertainty ⋮ On the probabilistic minimum coloring and minimum \(k\)-coloring ⋮ A priori optimization for the probabilistic maximum independent set problem ⋮ Probabilistic graph-coloring in bipartite and split graphs ⋮ Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function ⋮ Vertex-Uncertainty in Graph-Problems

Cites Work

• Unnamed Item

This page was built for publication: Shortest path problems with node failures