Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks
From MaRDI portal
Publication:534935
DOI10.1016/j.apm.2010.09.020zbMath1211.90043OpenAlexW2083812450MaRDI QIDQ534935
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
Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (3)
Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation ⋮ Binary-state line assignment optimization to maximize the reliability of an information network under time and budget constraints ⋮ An improved algorithm for finding all upper boundary points in a stochastic-flow network
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
- 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
- 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
- System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
- A sum of disjoint products algorithm for reliability evaluation of flow networks
This page was built for publication: Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks
