Time version of the shortest path problem in a stochastic-flow network
From MaRDI portal
Publication:1019780
DOI10.1016/j.cam.2008.09.003zbMath1161.90322OpenAlexW2021785639MaRDI QIDQ1019780
Publication date: 28 May 2009
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2008.09.003
Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15) Combinatorial optimization (90C27)
Related Items (9)
Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate ⋮ Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget ⋮ Stochastic computer network under accuracy rate constraint from QoS viewpoint ⋮ Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network ⋮ Performance evaluation for a transportation system in stochastic case ⋮ Reliability Evaluation of a Multi-state Network with Multiple Sinks under Individual Accuracy Rate Constraint ⋮ Decision diagram based symbolic algorithm for evaluating the reliability of a multistate flow network ⋮ Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability ⋮ Spare Reliability for Capacitated Computer Networks Under Tolerable Error Rate and Latency Considerations
Cites Work
- Internet packet routing: application of a \(K\)-quickest path algorithm
- The quickest path problem
- Minimum cost-reliability ratio path problem
- Distributed algorithms for the quickest path problem
- An algorithm for finding the \(k\) quickest paths in a network
- On the quickest path problem
- Algorithms for the constrained quickest path problem and the enumeration of quickest paths
- Finding the \(k\) quickest simple paths in a network
- An algorithm for the quickest path problem
- Minimum time paths in a network with mixed time constraints.
- Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
- A label-setting algorithm for finding a quickest path
- An algorithm for ranking quickest simple paths
- The all-pairs quickest path problem
- On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint
- Reliability Bounds for Multistate Systems with Multistate Components
- Reliability Evaluation of Multistate Systems with Multistate Components
- Deterministic network optimization: A bibliography
- Reliability evaluation of a limited-flow network in terms of minimal cutsets
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
- Fibonacci heaps and their uses in improved network optimization algorithms
This page was built for publication: Time version of the shortest path problem in a stochastic-flow network
