Spare routing problem with p minimal paths for time-based stochastic flow networks

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

Cites work

A label-setting algorithm for finding a quickest path
A sum of disjoint products algorithm for reliability evaluation of flow networks
Algorithms for the constrained quickest path problem and the enumeration of quickest paths
An algorithm for finding the \(k\) quickest paths in a network
An algorithm for ranking quickest simple paths
An algorithm for the quickest path problem
Computing Network Reliability in Time Polynomial in the Number of Cuts
Deterministic network optimization: A bibliography
Distributed algorithms for the quickest path problem
Enhancing a branch-and-bound algorithm for two-stage stochastic integer network design-based models
Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
Fibonacci heaps and their uses in improved network optimization algorithms
Finding the \(k\) quickest simple paths in a network
Internet packet routing: application of a \(K\)-quickest path algorithm
Measure the quality level for a supplier-demand system by a multicommodity stochastic-flow network
Minimum cost-reliability ratio path problem
Minimum time paths in a network with mixed time constraints.
On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint
On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
On the quickest path problem
Reliability Bounds for Multistate Systems with Multistate Components
Reliability Evaluation of Multistate Systems with Multistate Components
Reliability evaluation of a limited-flow network in terms of minimal cutsets
System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
The all-pairs quickest path problem
The quickest path problem

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
A method to evaluate routing policy through \(p\) minimal paths for stochastic case
Binary-state line assignment optimization to maximize the reliability of an information network under time and budget constraints
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)