An extended abstract of an indepth algorithmic and computational study for maximum flow problems

DOI10.1016/0166-218X(80)90045-1zbMath0452.90083MaRDI QIDQ1148822

David Whitman, Fred Glover, John Mote, Darwin D. Klingman

Publication date: 1980

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

computational studymaximum flow algorithmsextended abstractmaximum flow network problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)

Cites Work

• Computational Comparison of Eight Methods for the Maximum Network Flow Problem
• A network simplex method
• Unnamed Item