A dual simplex algorithm for finding all shortest paths

DOI10.1002/NET.3230110406MaRDI QIDQ3926369zbMATH OpenOpenAlexFDO

Authors Sang Nguyen, Stefano Pallottino, M. 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

computation of all shortest pathscomputational resultsdual simplex algorithmshortest path arborescence

Mathematics Subject Classification ID

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

Cited in

(5)

• Polynomial-time primal simplex algorithms for the minimum cost network flow problem
• A new algorithm for reoptimizing shortest paths when the arc costs change
• An auction-based approach for the re-optimization shortest path tree problem
• 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

This page was built for publication: A dual simplex algorithm for finding all shortest paths

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