Time version of the shortest path problem in a stochastic-flow network
From MaRDI portal
Publication:1019780
DOI10.1016/J.CAM.2008.09.003zbMATH Open1161.90322OpenAlexW2021785639MaRDI QIDQ1019780FDOQ1019780
Authors: Yi-Kuei Lin 
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
Recommendations
- System reliability for quickest path problems under time threshold and budget
- Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
- Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
- Stochastic flow networks via multiple paths under time threshold and budget constraint
- On transmission time through \(k\) minimal paths of a capacitated-flow network
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Stochastic network models in operations research (90B15)
Cites Work
- Fibonacci heaps and their uses in improved network optimization algorithms
- 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
- 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
- Reliability Bounds for Multistate Systems with Multistate Components
- The quickest path problem
- On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint
- Reliability evaluation of a limited-flow network in terms of minimal cutsets
- Distributed algorithms for the quickest path problem
- Minimum time paths in a network with mixed time constraints.
- Reliability Evaluation of Multistate Systems with Multistate Components
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
- Internet packet routing: application of a \(K\)-quickest path algorithm
- Minimum cost-reliability ratio path problem
- Deterministic network optimization: A bibliography
Cited In (20)
- Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks
- Performance evaluation for a transportation system in stochastic case
- Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
- Shortest paths in piecewise continuous time-dependent networks
- System reliability assessment through \(p\) minimal paths in stochastic case with backup-routing
- Reliability Evaluation of a Multi-state Network with Multiple Sinks under Individual Accuracy Rate Constraint
- 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
- Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate
- Decision diagram based symbolic algorithm for evaluating the reliability of a multistate flow network
- A directed hypergraph model for random time dependent shortest paths
- Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network
- Algorithms for the quickest time distribution of dynamic stochastic-flow networks
- An efficient alternative to the exact evaluation of the quickest path flow network reliability problem
- Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
- Stochastic computer network under accuracy rate constraint from QoS viewpoint
- A method to evaluate routing policy through \(p\) minimal paths for stochastic case
- Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget
- On transmission time through \(k\) minimal paths of a capacitated-flow network
- Stochastic flow networks via multiple paths under time threshold and budget constraint
This page was built for publication: Time version of the shortest path problem in a stochastic-flow network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1019780)
