Dual algorithms for the shortest path tree problem

DOI10.1002/(SICI)1097-0037(199703)29:2%3C125::AID-NET7%3E3.0.CO;2-LzbMATH Open0889.90148OpenAlexW2115847261MaRDI QIDQ4367280FDOQ4367280

Authors: Stefano Pallottino, Maria Grazia Scutellà 

Publication date: 25 November 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199703)29:2%3C125::aid-net7%3E3.0.co;2-l

Recommendations

• scientific article; zbMATH DE number 2096648
• An Auction Algorithm for Shortest Paths
• The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
• Shortest path methods: A unifying approach

zbMATH Keywords

parallel implementationreoptimizationshortest path tree problemdual ascent algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cited In (12)

• On the analysis of optimization problems in arc-dependent networks
• A GRASP and path relinking heuristic for rural road network development
• LP formulations of the shortest path tree problem
• An extension of labeling techniques for finding shortest path trees
• On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection
• A new algorithm for reoptimizing shortest paths when the arc costs change
• Title not available (Why is that?)
• An auction-based approach for the re-optimization shortest path tree problem
• Space-time tradeoffs in negative cycle detection - an empirical analysis of the stressing algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• ON SOLVING SHORTEST PATHS WITH A LEAST-SQUARES PRIMAL-DUAL ALGORITHM

This page was built for publication: Dual algorithms for the shortest path tree problem

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