A label-setting algorithm for finding a quickest path
From MaRDI portal
Publication:1886505
DOI10.1016/S0305-0548(03)00195-3zbMath1072.68123OpenAlexW1974572558MaRDI QIDQ1886505
Soondal Park, Chan-Kyoo Park, Sang Wook Lee
Publication date: 18 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)00195-3
Related Items (31)
Solving the absolute 1-center problem in the quickest path case ⋮ Fast and fine quickest path algorithm ⋮ Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints ⋮ Two exact algorithms for the traveling umpire problem ⋮ ESTIMATED AND ACCURATE SYSTEM RELIABILITIES OF A MAINTAINABLE COMPUTER NETWORK SUBJECT TO MAINTENANCE BUDGET ⋮ Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate ⋮ 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 ⋮ 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 ⋮ Stochastic flow networks via multiple paths under time threshold and budget constraint ⋮ Inverse quickest center location problem on a tree ⋮ 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 ⋮ Approximate path searching method for single-satellite observation and transmission task planning problem ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ 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 ⋮ Range-constrained traffic assignment with multi-modal recharge for electric vehicles ⋮ 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 ⋮ 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 ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The quickest path problem
- Algorithms for the quickest path problem and the enumeration of quickest paths
- On the quickest path problem
- Finding the \(k\) quickest simple paths in a network
- An algorithm for the quickest path problem
- Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
- Fast data transmission and maximal dynamic flow.
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Transmissions in a network with capacities and delays
This page was built for publication: A label-setting algorithm for finding a quickest path
