Fast and fine quickest path algorithm

DOI10.1016/j.ejor.2014.04.028zbMath1338.90433OpenAlexW2065639202MaRDI QIDQ296816

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) Communication networks in operations research (90B18) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

The energy-constrained quickest path problem ⋮ Dealing with residual energy when transmitting data in energy-constrained capacitated networks ⋮ Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks ⋮ A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem ⋮ Optimal flow and capacity allocation in multiple joint quickest paths of directed networks

Cites Work

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

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