An algorithm for the quickest path problem
From MaRDI portal
Publication:1362526
DOI10.1016/S0167-6377(97)00008-4zbMath0881.90124OpenAlexW1970958831MaRDI QIDQ1362526
Ernesto de Queirós Vieira Martins, José Luís Esteves dos Santos
Publication date: 8 October 1997
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(97)00008-4
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18)
Related Items (45)
Solving the absolute 1-center problem in the quickest path case ⋮ 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 ⋮ Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate ⋮ An efficient alternative to the exact evaluation of the quickest path flow network reliability problem ⋮ Min‐Max quickest path problems ⋮ 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 ⋮ Internet packet routing: application of a \(K\)-quickest path algorithm ⋮ Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points ⋮ 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 ⋮ Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm ⋮ Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm ⋮ Optimal paths in bi-attribute networks with fractional cost functions ⋮ 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 ⋮ 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 ⋮ Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa ⋮ The determination of the path with minimum-cost norm value ⋮ An efficient and robust design optimisation of multi-state flow network for multiple commodities using generalised reliability evaluation algorithm and edge reduction method ⋮ 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 ⋮ Reliability based assignment in stochastic-flow freight network ⋮ The continuous maximum capacity path interdiction problem ⋮ 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 ⋮ Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
Cites Work
This page was built for publication: An algorithm for the quickest path problem
