Computational Comparison of Eight Methods for the Maximum Network Flow Problem

DOI10.1145/355873.355874MaRDI QIDQ3870686zbMATH OpenOpenAlexFDO

Authors To-yat Cheung

Publication date 1980

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/355873.355874

zbMATH Keywords

breadth-first searchdepth-first searchcomparison of algorithmsDinic algorithmKarzanov algorithmmaximum network flow problemcomputational comparison of eight methodsflow augmentation along pathsflow augmentation through layersKinariwala-Rao algorithmlargest-augmentationlayer- updating

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(6)

• On the efficiency of maximum-flow algorithms on networks with small integer capacities
• An extended abstract of an indepth algorithmic and computational study for maximum flow problems
• Computational investigations of maximum flow algorithms
• Implementing Goldberg's max-flow-algorithm ? A computational investigation
• Enhanced instance space analysis for the maximum flow problem
• Linear dynamics for the state vector of Markov chain functions

This page was built for publication: Computational Comparison of Eight Methods for the Maximum Network Flow Problem

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