Algorithms for the constrained quickest path problem and the enumeration of quickest paths
From MaRDI portal
Publication:1318506
DOI10.1016/0305-0548(94)90045-0zbMath0795.90079OpenAlexW1550531993MaRDI QIDQ1318506
Publication date: 14 September 1994
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)90045-0
Related Items (35)
Fast and fine quickest path algorithm ⋮ Finding the k shortest paths in parallel ⋮ Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints ⋮ An efficient alternative to the exact evaluation of the quickest path flow network reliability problem ⋮ Routing scheme of a multi-state computer network employing a retransmission mechanism within a time threshold ⋮ Algorithms for the quickest path problem and the reliable quickest path problem ⋮ Algorithms for the quickest time distribution of dynamic stochastic-flow networks ⋮ Binary-state line assignment optimization to maximize the reliability of an information network under time and budget constraints ⋮ The energy-constrained quickest path problem ⋮ A method to evaluate routing policy through \(p\) minimal paths for stochastic case ⋮ System reliability for quickest path problems under time threshold and budget ⋮ Unnamed Item ⋮ On the sum-max bicriterion path problem. ⋮ The quickest path problem with batch constraints. ⋮ Stochastic flow networks via multiple paths under time threshold and budget constraint ⋮ Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network ⋮ Dealing with residual energy when transmitting data in energy-constrained capacitated networks ⋮ Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks ⋮ Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks ⋮ On transmission time through \(k\) minimal paths of a capacitated-flow network ⋮ The quickest path problem with interval lead times ⋮ An efficient and robust design optimisation of multi-state flow network for multiple commodities using generalised reliability evaluation algorithm and edge reduction method ⋮ Network reliability for multipath TCP networks with a retransmission mechanism under the time constraint ⋮ System Reliability Assessment throughpMinimal Paths in Stochastic Case with Backup-routing ⋮ Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks ⋮ Time version of the shortest path problem in a stochastic-flow network ⋮ Reliability based assignment in stochastic-flow freight network ⋮ Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints ⋮ Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability ⋮ Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget ⋮ Fast data transmission and maximal dynamic flow. ⋮ Reliability evaluation of a multistate network subject to time constraint under routing policy ⋮ Spare Reliability for Capacitated Computer Networks Under Tolerable Error Rate and Latency Considerations ⋮ The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets ⋮ Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
Cites Work
- The quickest path problem
- Minimum cost-reliability ratio path problem
- Algorithms for the quickest path problem and the enumeration of quickest paths
- Distributed algorithms for the quickest path problem
- Shortest-path algorithms: Taxonomy and annotation
- Bibliography on Algorithms for Shortest Path, Shortest Spanning Tree, and Related Circuit Routing Problems (1956–1974)
- Deterministic network optimization: A bibliography
- Fibonacci heaps and their uses in improved network optimization algorithms
This page was built for publication: Algorithms for the constrained quickest path problem and the enumeration of quickest paths
