On the quickest path problem
From MaRDI portal
Publication:1261485
DOI10.1016/0020-0190(93)90057-GzbMath0779.68065OpenAlexW2019129092MaRDI QIDQ1261485
Publication date: 19 January 1994
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90057-g
Related Items (34)
Probabilistic quickest path algorithm ⋮ A label-setting algorithm for finding a quickest path ⋮ 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 ⋮ ESTIMATED AND ACCURATE SYSTEM RELIABILITIES OF A MAINTAINABLE COMPUTER NETWORK SUBJECT TO MAINTENANCE BUDGET ⋮ Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation ⋮ 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 ⋮ 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. ⋮ Unnamed Item ⋮ 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 ⋮ An efficient and robust design optimisation of multi-state flow network for multiple commodities using generalised reliability evaluation algorithm and edge reduction method ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ Network reliability for multipath TCP networks with a retransmission mechanism under the time constraint ⋮ Network redesign for efficient crowd flow and evacuation ⋮ 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 ⋮ Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints ⋮ Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget ⋮ 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 ⋮ 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 finding paths with multiple constraints
- 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
- Unnamed Item
This page was built for publication: On the quickest path problem
