An algorithm for ranking quickest simple paths
From MaRDI portal
Publication:1886854
DOI10.1016/S0305-0548(03)00250-8zbMath1077.90075OpenAlexW2084878552MaRDI QIDQ1886854
Marta M. B. Pascoal, Joao Carlos Namorado Climaco, Maria Eugénia Captivo
Publication date: 19 November 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00250-8
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
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, A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem, An efficient alternative to the exact evaluation of the quickest path flow network reliability problem, Internet packet routing: application of a \(K\)-quickest path algorithm, 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, Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm, 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, A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem, 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, 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, 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
Cites Work
- A note on two problems in connexion with graphs
- The quickest path problem
- Algorithms for the quickest path problem and the enumeration of quickest paths
- An algorithm for finding the \(k\) quickest paths in a network
- On the quickest path problem
- Finding the \(k\) quickest simple paths in a network
- An algorithm for the quickest path problem
- An efficient algorithm for K shortest simple paths
- Finding the K Shortest Loopless Paths in a Network
