Fast and fine quickest path algorithm

DOI10.1016/J.EJOR.2014.04.028MaRDI QIDQ296816zbMATH OpenOpenAlexFDO

Authors Antonio Sedeño-Noda, Jonathan D. González-Barrera

Publication date 23 June 2016

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2014.04.028

zbMATH Keywords

OR in telecommunicationsquickest pathsupported non-dominated path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Communication networks in operations research (90B18)

Recommendations

• A label-setting algorithm for finding a quickest path
• An algorithm for the quickest path problem
• Algorithms for the quickest path problem and the enumeration of quickest paths
• A comprehensive survey on the quickest path problem
• On the quickest path problem

Cites work

• A comprehensive survey on the quickest path problem
• A label-setting algorithm for finding a quickest path
• A note on two problems in connexion with graphs
• Algorithms for the constrained quickest path problem and the enumeration of quickest paths
• Algorithms for the quickest path problem and the enumeration of quickest paths
• Algorithms for the quickest path problem and the reliable quickest path problem
• An algorithm for finding the \(k\) quickest paths in a network
• An algorithm for ranking quickest simple paths
• An algorithm for the quickest path problem
• Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm
• Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
• Fast data transmission and maximal dynamic flow.
• Fibonacci heaps and their uses in improved network optimization algorithms
• Finding the \(k\) quickest simple paths in a network
• Introduction to algorithms.
• MIN-MAX quickest path problems
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Network flows. Theory, algorithms, and applications.
• On the quickest path problem
• On the sum-max bicriterion path problem.
• Parametric objective function. I
• Probabilistic quickest path algorithm
• Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
• The all-pairs quickest path problem
• The quickest path problem
• The quickest path problem with batch constraints.
• The quickest path problem with interval lead times

Cited in

(8)

• Optimal flow and capacity allocation in multiple joint quickest paths of directed networks
• Quickest paths in anisotropic media
• The energy-constrained quickest path problem
• Dealing with residual energy when transmitting data in energy-constrained capacitated networks
• A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem
• A label-setting algorithm for finding a quickest path
• Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks
• Faster algorithm to find anti-risk path between two nodes of an undirected graph

This page was built for publication: Fast and fine quickest path algorithm

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