The all-pairs quickest path problem
From MaRDI portal
Recommendations
Cites work
- Algorithms for the quickest path problem and the enumeration of quickest paths
- Fibonacci heaps and their uses in improved network optimization algorithms
- scientific article; zbMATH DE number 3900809 (Why is no real title available?)
- scientific article; zbMATH DE number 3907787 (Why is no real title available?)
- scientific article; zbMATH DE number 3481857 (Why is no real title available?)
- The quickest path problem
Cited in
(44)- Time version of the shortest path problem in a stochastic-flow network
- Reliability based assignment in stochastic-flow freight network
- An algorithm for finding the \(k\) quickest paths in a network
- On the quickest path problem
- The inverse-parametric knapsack problem
- On the sum-max bicriterion path problem.
- Routing scheme of a multi-state computer network employing a retransmission mechanism within a time threshold
- Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks
- The quickest path problem with interval lead times
- A cost-time trade-off Königsberg bridge problem traversing all the seven bridges allowing repetition
- Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
- Probabilistic quickest path algorithm
- Optimal flow and capacity allocation in multiple joint quickest paths of directed networks
- Solving the absolute 1-center problem in the quickest path case
- Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation
- Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget
- Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
- A comprehensive survey on the quickest path problem
- Fast data transmission and maximal dynamic flow.
- System reliability assessment through p minimal paths in stochastic case with backup-routing
- All pairs lightest shortest paths
- Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints
- 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
- Estimated and accurate system reliabilities of a maintainable computer network subject to maintenance budget
- Fast and fine quickest path algorithm
- The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets
- An efficient alternative to the exact evaluation of the quickest path flow network reliability problem
- scientific article; zbMATH DE number 5289563 (Why is no real title available?)
- Algorithms for the quickest time distribution of dynamic stochastic-flow networks
- Estimation of maintenance reliability for a cloud computing network
- Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network
- Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks
- Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability
- MIN-MAX quickest path problems
- Spare routing problem with p minimal paths for time-based stochastic flow networks
- Computational Science - ICCS 2004
- A method to evaluate routing policy through \(p\) minimal paths for stochastic case
- System reliability for quickest path problems under time threshold and budget
- Stochastic flow networks via multiple paths under time threshold and budget constraint
- A Monte Carlo-based algorithm for the quickest path flow network reliability problem
- A priority queue for the all pairs shortest path problem
- The quickest path problem
- On transmission time through \(k\) minimal paths of a capacitated-flow network
This page was built for publication: The all-pairs quickest path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366074)
