175 Years of linear programming: max flow = min cut

Chandru, Vijay ; Rao, M. R. (1999) 175 Years of linear programming: max flow = min cut Resonance - Journal of Science Education, 4 (10). pp. 22-39. ISSN 0971-8044

Full text not available from this repository.

Official URL: http://www.ias.ac.in/resonance/Oct1999/index.html

Related URL: http://dx.doi.org/10.1007/BF02834257


The theory of flows in networks began to evolve in the early 1950's.The various linear optimisation questions that could be asked of flows in conserving networks turned out to be neat combinatorial specialisations of linear programming. The simplex method (and its variants) turned out to have very pretty combinatorial interpretations on networks. The algebraic dexterity of linear programming duality led to a unified treatment of many deep theorems in graph theory and combinatorics. In this part, the last of the series on linear programming, we will see glimpses of the theory of network flows through a specific flow optimisation problem - the maximum flow problem.

Item Type:Article
Source:Copyright of this article belongs to Indian Academy of Sciences.
ID Code:5528
Deposited On:19 Oct 2010 12:01
Last Modified:10 Oct 2011 09:36

Repository Staff Only: item control page