An algorithmic study of the maximum flow problem: A comparative statistical analysis

DOI10.1007/BF02564832zbMath0966.90067OpenAlexW1551148555MaRDI QIDQ1592633

R. Smith

Publication date: 2 April 2001

Published in: Top (Search for Journal in Brave)

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

zbMATH Keywords

network programmingstatistical analysisexperimental designmaximum flow algorithm

Mathematics Subject Classification ID

Design of statistical experiments (62K99) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (3)

A generalization of the scaling max-flow algorithm ⋮ Preemptive benchmarking problem: An approach for official statistics in small areas ⋮ Enhanced instance space analysis for the maximum flow problem

Uses Software

• DIMACS
• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• Computational investigations of maximum flow algorithms
• A Fast and Simple Algorithm for the Maximum Flow Problem
• Analysis of Preflow Push Algorithms for Maximum Network Flow
• Maximal Flow Through a Network
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Implementing Goldberg's max-flow-algorithm ? A computational investigation
• Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems

This page was built for publication: An algorithmic study of the maximum flow problem: A comparative statistical analysis