An algorithm for the quickest path problem

DOI10.1016/S0167-6377(97)00008-4zbMATH Open0881.90124OpenAlexW1970958831MaRDI QIDQ1362526FDOQ1362526

Authors: 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

Recommendations

• On the quickest path problem
• Algorithms for the quickest path problem and the enumeration of quickest paths
• The quickest path problem

zbMATH Keywords

networkquickest path problempath capacitybicriteria path problemnondominated pathpath distance

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18)

Cites Work

• Fibonacci heaps and their uses in improved network optimization algorithms
• Title not available (Why is that?)
• The quickest path problem
• On a special class of bicriterion path problems

Cited In (56)

• Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa
• Network reliability for multipath TCP networks with a retransmission mechanism under the time constraint
• Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm
• Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget
• Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks
• Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
• Reliability evaluation of a multistate network subject to time constraint under routing policy
• The continuous maximum capacity path interdiction problem
• Solving the absolute 1-center problem in the quickest path case
• Estimated and accurate system reliabilities of a maintainable computer network subject to maintenance budget
• Inverse quickest center location problem on a tree
• The energy-constrained quickest path problem
• Dealing with residual energy when transmitting data in energy-constrained capacitated networks
• Fast and fine quickest path algorithm
• System reliability assessment through \(p\) minimal paths in stochastic case with backup-routing
• Algorithms for the quickest path problem and the reliable quickest path problem
• An efficient and robust design optimisation of multi-state flow network for multiple commodities using generalised reliability evaluation algorithm and edge reduction method
• The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets
• An algorithm for the solution of the two-route Johnson problem
• Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points
• The quickest path problem
• Bicriteria shortest path in networks of queues
• Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm
• The determination of the path with minimum-cost norm value
• Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• An algorithm to determine a path with minimal cost/capacity ratio
• On the quickest path problem
• Algorithms for the constrained quickest path problem and the enumeration of quickest paths
• System reliability for quickest path problems under time threshold and budget
• 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
• Spare reliability for capacitated computer networks under tolerable error rate and latency considerations
• Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate
• A lower bound for the quickest path problem
• Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network
• The quickest path problem with interval lead times
• Routing scheme of a multi-state computer network employing a retransmission mechanism within a time threshold
• MIN-MAX quickest path problems
• An efficient alternative to the exact evaluation of the quickest path flow network reliability problem
• Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
• A label-setting algorithm for finding a quickest path
• An algorithm for ranking quickest simple paths
• Reliability based assignment in stochastic-flow freight network
• Time version of the shortest path problem in a stochastic-flow network
• Binary-state line assignment optimization to maximize the reliability of an information network under time and budget constraints
• A method to evaluate routing policy through \(p\) minimal paths for stochastic case
• A comprehensive survey on the quickest path problem
• Optimal paths in bi-attribute networks with fractional cost functions
• Title not available (Why is that?)
• On transmission time through \(k\) minimal paths of a capacitated-flow network
• Stochastic flow networks via multiple paths under time threshold and budget constraint
• Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation
• Estimation of maintenance reliability for a cloud computing network
• Title not available (Why is that?)
• Internet packet routing: application of a \(K\)-quickest path algorithm

This page was built for publication: An algorithm for the quickest path problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362526)