The probabilistic longest path problem
From MaRDI portal
Publication:4254356
DOI<207::AID-NET7>3.0.CO;2-7 10.1002/(SICI)1097-0037(199905)33:3<207::AID-NET7>3.0.CO;2-7zbMath0949.90013OpenAlexW2007917614MaRDI QIDQ4254356
Cécile Murat, Vangelis Th. Paschos
Publication date: 29 June 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199905)33:3<207::aid-net7>3.0.co;2-7
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Stochastic network models in operations research (90B15)
Related Items
A survey on combinatorial optimization in dynamic environments ⋮ Information security: Designing a stochastic-network for throughput and reliability ⋮ The probabilistic minimum dominating set problem ⋮ On the probabilistic min spanning tree problem ⋮ Network reliability: Heading out on the highway ⋮ Theory and application of reciprocal transformation of “path problem” and “time float problem” ⋮ On the probabilistic minimum coloring and minimum \(k\)-coloring ⋮ Probabilistic models for the Steiner Tree problem ⋮ Probabilistic graph-coloring in bipartite and split graphs ⋮ Vertex-Uncertainty in Graph-Problems
Cites Work
