Performance of Shortest Path Algorithms in Network Flow Problems

DOI10.1287/mnsc.36.6.661zbMath0699.90031OpenAlexW2157943272MaRDI QIDQ3478234

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

test problemsminimum cost flowshortest path algorithmsdynamic topologyempirical testing

Mathematics Subject Classification ID

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

Related Items (1)

A comprehensive simplex-like algorithm for network optimization and perturbation analysis

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