Implementing Goldberg's max-flow-algorithm ? A computational investigation

DOI10.1007/BF01415937MaRDI QIDQ4207771zbMATH OpenWikidataFDO

Authors

Publication date 1989

Published in ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01415937

zbMATH Keywords

Goldberg-Tarjan algorithmmaximum flow

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 515922
• Improved Time Bounds for the Maximum Flow Problem
• scientific article; zbMATH DE number 515923
• A new approach to the maximum-flow problem
• scientific article; zbMATH DE number 1766747

Cites work

• A primal simplex variant for the maximum-flow problem
• Computational Comparison of Eight Methods for the Maximum Network Flow Problem
• scientific article; zbMATH DE number 3475221 (Why is no real title available?)
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• Maximal Flow Through a Network
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• ON THE PRACTICAL EFFICIENCY OF VARIOUS MAXIMUM FLOW ALGORITHMS

Cited in

(19)

• On the efficiency of maximum-flow algorithms on networks with small integer capacities
• Computational investigations of maximum flow algorithms
• Diagnosing infeasibilities in network flow problems
• An algorithmic study of the maximum flow problem: A comparative statistical analysis
• A generalization of the scaling max-flow algorithm
• An auction algorithm for the max-flow problem
• An efficient cost scaling algorithm for the assignment problem
• Enhanced instance space analysis for the maximum flow problem
• Preemptive benchmarking problem: An approach for official statistics in small areas
• Efficient preflow push algorithms
• scientific article; zbMATH DE number 45131 (Why is no real title available?)
• The quickest flow problem
• scientific article; zbMATH DE number 515922 (Why is no real title available?)
• scientific article; zbMATH DE number 515923 (Why is no real title available?)
• scientific article; zbMATH DE number 515924 (Why is no real title available?)
• Recent developments in maximum flow algorithms
• On implementing push-relabel method for the maximum flow problem
• Simplifications and speedups of the pseudoflow algorithm
• The maximum flow problem: A max-preflow approach

Describes a project that uses

Uses Software

• NETGEN

This page was built for publication: Implementing Goldberg's max-flow-algorithm ? A computational investigation

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