# Maximal Flow Through a Network

```@article{Ford1956MaximalFT,
title={Maximal Flow Through a Network},
author={Lester Randolph Ford and Delbert Ray Fulkerson},
journal={Canadian Journal of Mathematics},
year={1956},
volume={8},
pages={399 - 404}
}```
• Published 1956
• Mathematics
• Canadian Journal of Mathematics
Introduction. The problem discussed in this paper was formulated by T. Harris as follows: “Consider a rail network connecting two cities by way of a number of intermediate cities, where each link of the network has a number assigned to it representing its capacity. Assuming a steady state condition, find a maximal flow from one given city to the other.”
2,752 Citations

### Removing Arcs from a Network

This paper proposes an algorithm for making a sensitivity analysis on a flow network, specifically, the problem of removing n arcs in a network such that the reduction in the maximum flow between an

### Capacity of a Network with Increasing Demands and Arcs Subject to Failure

• Computer Science
Oper. Res.
• 1971
An algorithm for finding the maximum time up to which all demands can be satisfied is given, for source-sink planar networks, even if any set of a specified number of arcs of the network has the arc capacities reduced to given lower values.

### SOLUTIONS OF THE SHORTEST-ROUTE PROBLEM-A REVIEW

• Mathematics
• 1960
Several methods are available for determining the shortest route through a network. These methods are described in some detail with added remarks as to their relative merits. Most of the methods are

### Multi-Commodity Network Flows

A network is a set of nodes Ni connected by arcs with nonnegative arc capacities bij which indicates the maximum amount of flow that can pass through the arc from Ni to Nj. Given all bij, there is a

### Appraising feasibility and maximal flow capacity of a network

Abstract : The use of the dual graph in determining the value of the maximal flow capacity of an undirected network has been extended to directed networks. A directed dual graph is defined such that

### Line Planning and Connectivity

• Mathematics
Models and Algorithms for Optimization in Logistics
• 2009
It is shown that directed models provide tight formulations for the Steiner connectivity problem, similar as for theSteiner tree problem.

• R. Vanderbei