Spare routing problem with p minimal paths for time-based stochastic flow networks
From MaRDI portal
Publication:534935
DOI10.1016/J.APM.2010.09.020zbMATH Open1211.90043OpenAlexW2083812450MaRDI QIDQ534935FDOQ534935
Authors: Yi-Kuei Lin 
Publication date: 10 May 2011
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2010.09.020
Recommendations
- System reliability assessment through \(p\) minimal paths in stochastic case with backup-routing
- Time version of the shortest path problem in a stochastic-flow network
- Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation
- Stochastic flow networks via multiple paths under time threshold and budget constraint
- System reliability for quickest path problems under time threshold and budget
Reliability, availability, maintenance, inspection in operations research (90B25) 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
- A sum of disjoint products algorithm for reliability evaluation of flow networks
- The quickest path problem
- System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
- 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
- Enhancing a branch-and-bound algorithm for two-stage stochastic integer network design-based models
- Computing Network Reliability in Time Polynomial in the Number of Cuts
- Measure the quality level for a supplier-demand system by a multicommodity stochastic-flow network
- Deterministic network optimization: A bibliography
Cited In (6)
- System reliability assessment through \(p\) minimal paths in stochastic case with backup-routing
- An improved algorithm for finding all upper boundary points in a stochastic-flow network
- Binary-state line assignment optimization to maximize the reliability of an information network under time and budget constraints
- A method to evaluate routing policy through \(p\) minimal paths for stochastic case
- Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation
- The path restoration version of the spare capacity allocation problem with modularity restrictions: models, algorithms, and an empirical analysis
This page was built for publication: Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534935)
