Abstract
The research in this subject has now a long history and a large variety of related fields in science, engineering and operations research, and is still developing fast, especially in its algorithmic aspects, attracting many excellent senior as well as young researchers. And the space allotted to this paper is limited. So, in this paper I will not lay so much stress on particular frontiers of research in the subject as on the wider and historical viewpoint.
Chapter PDF
Similar content being viewed by others
References
Ahuja, R.K., Magnanti, T.L. and Orlin, J.B. (1993) Network Flows — Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, New Jersey.
Arnott, R. and Small, K. (1994) The economics of traffic congestion. American Scientists, 82, 446–455.
Berge, C. et Ghouila-Houri, A. (1962) Programmes, Jeux et Réseaux de Transport. Dunod, Paris.
Bixby, R.E. and Cunningham, W.H. (1980) Converting linear programs to network programs. Mathematics of Operations Research, 5, 321–357.
Blum, W. (1990) A measure-theoretical max-flow-min-cut problem. Mathematische Zeitschrift, 205, 451–470.
Braess, D. (1968) Über ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung, 12, 258–684.
Carré, B.A. (1971a) An algebra for network routing problems. Journal of the Institute of Mathematics and Its Applications, 7, 273–94.
Carré, B.A. (1971b) An elimination method for minimal cost network flow problem, in Large Sparse Sets of Linear Equations (ed. J.K. Reid ), Academic Press.
Churchman, C.W., Ackoff, R.L. and Arnoff, E.L. (1957) Introduction to Operations Research. John Wiley and Sons, New York, 377–379.
Dennis, J.B. (1959) Mathematical Programming and Electrical Networks. MIT Technology Press, Cambridge, Massachusetts, and John Wiley and Sons, New York.
Ford,L.R., Jr., and Fulkerson, D.R. (1962) Flows in Networks. Princeton University Press, Princeton, New Jersey.
Fujishige, S. (1980) An efficient PQ-graph algorithm for solving the graph-realization problem. Journal of Computers and System Sciences, 21, 63–86.
Fujishige, S. (1991) Submodular Functions and Optimization. Annals of Discrete Mathematics 47, North-Holland, Amsterdam-New York-Oxford-Tokyo.
Gautier, A. and Granot, F. (1994) On the equivalence of constrained and unconstrained flows. Discrete Applied Mathematics, 55, 113–132.
Hu, T.C. (1969) Integer Programming and Network Flows. Addison-Wesley, Massachusetts.
Iri, M. (1959) Algebraic and topological theory of the problems of transportation networks with the help of electric circuit models. RAAG Research Notes, Third Series, No. 13.
Iri, M., Amari, S. and Takata, M. (1961) Linear programming with weak graphical representation. RAAG Research Notes, Third Series, No. 47.
Iri, M. (1962) A necessary and sufficient condition for a matrix to be a loop or cut-set matrix of a graph and a practical method for the topological synthesis of networks. RAAG Research Notes, Third Series, No. 50.
M. (1966) A criterion for the reducibility of a linear programming problem to a linear network-flow problem. RAAG Research Notes, Third Series, No. 98.
Iri, M. (1968) On the synthesis of loop and cutset matrices and the related problems. RAAG Memoirs, 4, A-XIII, 4–38.
Iri, M., Amari, S. and Takata, M. (1968) Algebraical and topological theory and methods of linear programming with weak graphical representation. RAAG Memoirs, 4, MiscVII, 539–620.
Iri, M. (1969) Network Flow, Transportation and Scheduling —Theory and Algorithms. Academic Press, New York and London.
Iri, M. (1980) Theory of flows in continua as approximation to flows in networks, in Survey of Mathematical Programming (ed. A. Prékopa), (Proceedings of the IXth International Symposium on Mathematical Programming, Budapest, 1976), North-Holland, 2.
Iri, M. (1981) “Dualities” in graph theory and in the related fields viewed from the metatheoretical standpoint, in Graph Theory and Algorithms, (eds. N. Saito and T. Nishizeki), Lecture Notes in Computer Science 108, Springer-Verlag, Berlin-HeidelbergNew York.
M. (1994) An Essay in the Theory of Uncontrollable Flows and Congestion. TRISE (Technical Report on Information and System Engineering) 94–03, Faculty of Science and Engineering, Chuo University. (Also presented at the XVth International Symposium on Mathematical Programming, August 1994, University of Michigan, Ann Arbor, Michigan. )
Jewell, W.S. (1962) Optimal flows with gains. Operations Research, 10, 476–499.
Jewell, W.S. (1965) Divisible activities in critical path analysis. Operations Research, 13, 747–760.
Jewell, W.S. (1966) A Primal-Dual Multi-commodity Flow Algorithm. Report ORC 66–24, OR Center, University of California, Berkeley, California.
Kantorovitch, L. (1942) On the translocation of masses. Comptes Rendus (Doklady) de l’Academie des Sciences de l’URSS, XXXVII, 199–201 (Mathematics).
Lawler, E.L. (1967) Optimal cycles in doubly weighted linear graphs, in Theory of Graphs (ed. P. Rosenstiehl ), Dunod, Paris.
Megiddo, N. (1979) Combinatorial optimization with rational objective functions. Mathematics of Operations Research, 4, 414–424.
Minty, G.J. (1960) Monotone networks. Proceedings of the Royal Society, A251, 194–212.
Minty, G.J. (1966) On the axiomatic foundation on the theories of directed linear graphs, electrical networks and network-programming. Journal of Mathematics and Mechanics, 15, 485–520.
Monge, G. (1781) Déblai et remblai. Mémoires de l’Academie des Sciences.
Nozawa, R. (1994) Examples of max-flow and min-cut problems with duality gaps in continuous networks. Mathematical Programming, 63, 213–234.
Rockafellar, R.T. (1984) Network Flows and Monotropic Optimization. John Wiley and Sons, New York.
Strang, G. (1983) Maximal flow through a domain. Mathematical Programming, 26, 123–143.
Taguchi, A. and Iri, M. (1982) Continuum approximation to dense networks and its application to the analysis of urban road networks. Mathematical Programming Study, 20, 178–217.
Wardrop, J.G. (1952) Some theoretical aspects of road traffic research. Proceedings of the Institute of Civil Engineers, 1, 325–378.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Iri, M. (1996). Network flow — Theory and applications with practical impact. In: Doležal, J., Fidler, J. (eds) System Modelling and Optimization. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34897-1_3
Download citation
DOI: https://doi.org/10.1007/978-0-387-34897-1_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6671-4
Online ISBN: 978-0-387-34897-1
eBook Packages: Springer Book Archive