Algorithms for the quickest path problem and the reliable quickest path problem

DOI10.1007/s10287-012-0138-2zbMath1273.90169OpenAlexW2028546357MaRDI QIDQ373197

José A. Iranzo, Lourdes Del-Pozo, Herminia I. Calvete

Publication date: 21 October 2013

Published in: Computational Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10287-012-0138-2

zbMATH Keywords

reliabilityquickest pathranking quickest pathsrecursive constraint

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items

Solving the absolute 1-center problem in the quickest path case ⋮ Fast and fine quickest path algorithm ⋮ Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation ⋮ An efficient alternative to the exact evaluation of the quickest path flow network reliability problem ⋮ The energy-constrained quickest path problem ⋮ Inverse quickest center location problem on a tree ⋮ 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 ⋮ Optimal flow and capacity allocation in multiple joint quickest paths of directed networks

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• The quickest path problem
• Algorithms for the quickest path problem and the enumeration of quickest paths
• 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
• The quickest path problem with batch constraints.
• The quickest path problem with interval lead times
• A label-setting algorithm for finding a quickest path
• A comprehensive survey on the quickest path problem
• Shortest chain subject to side constraints
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Finding the K Shortest Loopless Paths in a Network