An extension of labeling techniques for finding shortest path trees

DOI10.1016/j.ejor.2008.08.018zbMath1163.90778OpenAlexW2020532780MaRDI QIDQ1027584

Athanasios K. Ziliaskopoulos, Hani S. Mahmassani, Fotios D. Mandanas

Publication date: 30 June 2009

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

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

zbMATH Keywords

transportationshortest pathrouting

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (4)

Finding the shortest paths by node combination ⋮ A comparison of heuristic best-first algorithms for bicriterion shortest path problems ⋮ Using matrices to link conflict evolution and resolution in a graph model ⋮ Reconstructing freeway travel times with a simplified network flow model alternating the adopted fundamental diagram

Uses Software

• Algorithm 360

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Experiments with parallel algorithms for combinatorial problems
• Multicriteria adaptive paths in stochastic, time-varying networks
• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
• A New Polynomially Bounded Shortest Path Algorithm
• An Auction Algorithm for Shortest Paths
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
• Dual algorithms for the shortest path tree problem
• Dynamic shortest paths minimizing travel times and costs
• Implementation and efficiency of Moore-algorithms for the shortest route problem
• On the online shortest path problem with limited arc cost dependencies
• A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures

This page was built for publication: An extension of labeling techniques for finding shortest path trees