Operations Research · 1964 · 22 citations · 1 references
Natural SciencesComputer ScienceOptimizationCombinatorial OptimizationFlow ModelingNetwork AnalysisNetwork Flow AlgorithmsNetwork FlowsNetwork OptimizationFlow NetworksMaximum FlowMaximum Flow AlgorithmsMaximum Flow ProblemsNetwork Flow FormulationsNetwork Flow ModelsNetwork Flow OptimizationNetwork Flow Problems
Given an undirected flow network with finite arc capacities, an algorithm is developed for the determination of the effect of a reduction (or increase) in the capacity of any arc on the maximum flow between any two nodes of the network. The algorithm is based on the Gomory-Hu construction of “cut-trees.”
1