Performance of Shortest Path Algorithms in Network Flow Problems

DOI10.1287/MNSC.36.6.661MaRDI QIDQ3478234zbMATH OpenOpenAlexFDO

Authors James J. Divoky, Ming S. Hung

Publication date 1990

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.36.6.661

zbMATH Keywords

minimum cost flowtest problemsdynamic topologyshortest path algorithmsempirical testing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)

Recommendations

• Some Recent Advances in Network Flows
• scientific article; zbMATH DE number 4174642
• scientific article; zbMATH DE number 1918689
• scientific article; zbMATH DE number 5173820
• scientific article; zbMATH DE number 515927

Cited in

(3)

• Implementation and analysis of alternative algorithms for generalized shortest path problems
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis
• On Some Special Network Flow Problems: The Shortest Path Tour Problems

This page was built for publication: Performance of Shortest Path Algorithms in Network Flow Problems

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