Stochastic flow networks via multiple paths under time threshold and budget constraint
From MaRDI portal
Publication:660929
DOI10.1016/J.CAMWA.2011.08.002zbMath1231.90115OpenAlexW2059723391MaRDI QIDQ660929
Publication date: 5 February 2012
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2011.08.002
Stochastic network models in operations research (90B15) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Related Items (2)
Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation ⋮ A modeling framework for supporting and evaluating performance of multi-hop paths in mobile ad-hoc wireless networks
Cites Work
- Internet packet routing: application of a \(K\)-quickest path algorithm
- The quickest path problem
- Minimum cost-reliability ratio path problem
- Lower bounds on two-terminal network reliability
- 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
- 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
- A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
This page was built for publication: Stochastic flow networks via multiple paths under time threshold and budget constraint
