Numerical investigations on the maximal flow algorithm of Karzanov

DOI10.1007/BF02246557zbMath0402.90041MaRDI QIDQ1255886

Horst W. Hamacher

Publication date: 1979

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

Computational EfficiencyMaximal FlowExplicit Machine CodeImplementation StudyNetwork Programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Specification and verification (program logics, model checking, etc.) (68Q60) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (2)

Computational investigations of maximum flow algorithms ⋮ Characterization of all optimal solutions and parametric maximal mows in networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Flow Switching Approach to the Maximum Flow Problem: I
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

This page was built for publication: Numerical investigations on the maximal flow algorithm of Karzanov