Stochastic flow networks via multiple paths under time threshold and budget constraint
From MaRDI portal
Publication:660929
Recommendations
- Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
- System reliability for quickest path problems under time threshold and budget
- Time version of the shortest path problem in a stochastic-flow network
- Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
- Reliability evaluation of a stochastic-flow network under both time and cost constraints
Cites work
- A label-setting algorithm for finding a quickest path
- A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
- 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
- Deterministic network optimization: A bibliography
- Distributed algorithms for the quickest path problem
- 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
- Lower bounds on two-terminal network reliability
- 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
- The all-pairs quickest path problem
- The quickest path problem
Cited in
(14)- Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks
- Optimal flow and capacity allocation in multiple joint quickest paths of directed networks
- Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
- scientific article; zbMATH DE number 6783389 (Why is no real title available?)
- A modeling framework for supporting and evaluating performance of multi-hop paths in mobile ad-hoc wireless networks
- Algorithms for the quickest time distribution of dynamic stochastic-flow networks
- Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
- Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements
- Flows over edge-disjoint mixed multipaths and applications
- Time version of the shortest path problem in a stochastic-flow network
- Reliability evaluation and big data analytics architecture for a stochastic flow network with time attribute
- On transmission time through \(k\) minimal paths of a capacitated-flow network
- Reliability evaluation of a stochastic-flow network under both time and cost constraints
- Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation
This page was built for publication: Stochastic flow networks via multiple paths under time threshold and budget constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q660929)
