Dual algorithms for the shortest path tree problem

DOI<125::AID-NET7>3.0.CO;2-L 10.1002/(SICI)1097-0037(199703)29:2<125::AID-NET7>3.0.CO;2-LzbMath0889.90148OpenAlexW2115847261MaRDI QIDQ4367280

Maria Grazia Scutellà, Stefano Pallottino

Publication date: 25 November 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199703)29:2<125::aid-net7>3.0.co;2-l

zbMATH Keywords

parallel implementationreoptimizationshortest path tree problemdual ascent algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (7)

Space-time tradeoffs in negative cycle detection - an empirical analysis of the stressing algorithm ⋮ On the analysis of optimization problems in arc-dependent networks ⋮ A new algorithm for reoptimizing shortest paths when the arc costs change ⋮ On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection ⋮ An auction-based approach for the re-optimization shortest path tree problem ⋮ An extension of labeling techniques for finding shortest path trees ⋮ A GRASP and path relinking heuristic for rural road network development

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