A dual simplex algorithm for finding all shortest paths

DOI10.1002/net.3230110406zbMath0471.90085OpenAlexW2074609999MaRDI QIDQ3926369

Stefano Pallottino, Sang Nguyen, Michael Florian

Publication date: 1981

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230110406

zbMATH Keywords

computational resultsdual simplex algorithmcomputation of all shortest pathsshortest path arborescence

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05)

Related Items

Shortest path reoptimization vs resolution from scratch: a computational comparison, Models and Software for Urban and Regional Transportation Planning: The Contributions of the Center for Research on Transportation, A new algorithm for reoptimizing shortest paths when the arc costs change, Polynomial-time primal simplex algorithms for the minimum cost network flow problem, An auction-based approach for the re-optimization shortest path tree problem