An algorithm for finding the \(k\) quickest paths in a network
From MaRDI portal
Publication:1201855
DOI10.1016/0305-0548(93)90096-2zbMath0773.90081OpenAlexW2014156227MaRDI QIDQ1201855
Publication date: 17 January 1993
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(93)90096-2
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
Related Items (30)
An algorithm for ranking quickest simple paths ⋮ Fast and fine quickest path algorithm ⋮ Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints ⋮ A comprehensive survey on the quickest path problem ⋮ Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation ⋮ Routing scheme of a multi-state computer network employing a retransmission mechanism within a time threshold ⋮ A method to evaluate routing policy through \(p\) minimal paths for stochastic case ⋮ System reliability for quickest path problems under time threshold and budget ⋮ 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 ⋮ 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 ⋮ A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem ⋮ 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 ⋮ Finding the k Shortest Paths ⋮ 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 ⋮ Fast data transmission and maximal dynamic flow. ⋮ Optimal flow and capacity allocation in multiple joint quickest paths of directed networks ⋮ 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 ⋮ Finding the \(k\) quickest simple paths in a network ⋮ 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
- Unnamed Item
- The quickest path problem
- Algorithms for the quickest path problem and the enumeration of quickest paths
- On algorithms for finding the k shortest paths in a network
- Shortest-path algorithms: Taxonomy and annotation
- An efficient algorithm for K shortest simple paths
- Data Structures and Computer Science Techniques in Operations Research
- Fibonacci heaps and their uses in improved network optimization algorithms
- An Appraisal of Some Shortest-Path Algorithms
- Finding the K Shortest Loopless Paths in a Network
This page was built for publication: An algorithm for finding the \(k\) quickest paths in a network
