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

DOI10.1007/BF01415937zbMath0688.90021WikidataQ57407476 ScholiaQ57407476MaRDI QIDQ4207771

No author found.

Publication date: 1989

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

zbMATH Keywords

maximum flowGoldberg-Tarjan algorithm

Mathematics Subject Classification ID

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

Related Items (14)

A generalization of the scaling max-flow algorithm ⋮ Recent developments in maximum flow algorithms ⋮ Preemptive benchmarking problem: An approach for official statistics in small areas ⋮ 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 ⋮ Simplifications and speedups of the pseudoflow algorithm ⋮ On implementing push-relabel method for the maximum flow problem ⋮ The quickest flow problem ⋮ Efficient preflow push algorithms ⋮ Computational investigations of maximum flow algorithms ⋮ Diagnosing infeasibilities in network flow problems ⋮ An algorithmic study of the maximum flow problem: A comparative statistical analysis ⋮ The maximum flow problem: A max-preflow approach

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Maximal Flow Through a Network
• A primal simplex variant for the maximum-flow problem
• Computational Comparison of Eight Methods for the Maximum Network Flow Problem
• 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

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