Discrete Optimization: Network Flows and Matchings

Chapter
Part of the Mathematics for Industry book series (MFI, volume 5)

Abstract

In this paper, we give a brief introduction to network flow problems and matching problems that are representative problems in discrete optimization. Network flow problems are used for modeling, e.g., car traffic and evacuation. Matching problems are used when we allocate jobs to workers and assign students to laboratories, and so on. Especially, we focus on mathematical models that are used in these problems.

Keywords

Discrete optimization Matching Network flow 

References

  1. 1.
    R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms, and Applications (Prentice Hall, Englewood Cliffs, 1993)Google Scholar
  2. 2.
    J. Bang-Jensen, G.Z. Gutin, Digraphs: Theory, Algorithms and Applications (Springer, New York, 2009)Google Scholar
  3. 3.
    J. Edmonds, Paths, trees, and flowers. Can. J. Math. 17, 449–467 (1965)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    A. Erdil, H. Ergin, What’s the matter with tie-breaking? Improving efficiency in school choice. Am. Econ. Rev. 98(3), 669–689 (2008)CrossRefGoogle Scholar
  5. 5.
    L.R. Ford, D.R. Fulkerson, Flows in Networks (Princeton University Press, New Jersey, 1962)Google Scholar
  6. 6.
    L.R. Ford, D.R. Fulkerson, Constructing maximal dynamic flows from static flows. Oper. Res. 6(3), 419–433 (1958)MathSciNetCrossRefGoogle Scholar
  7. 7.
    D. Gale, L.S. Shapley, College admissions and the stability of marriage. Am. Math. Monthly 69(1), 9–15 (1962)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    P. Gärdenfors, Match making: assignments based on bilateral preferences. Behav. Sci. 20(3), 166–173 (1975)CrossRefGoogle Scholar
  9. 9.
    A.V. Goldberg, R.E. Tarjan, A new approach to the maximum-flow problem. J. ACM 35(4), 921–940 (1988)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    A. Hall, S. Hippler, M. Skutella, Multicommodity flows over time: efficient algorithms and complexity. Theoret. Comput. Sci. 379(3), 387–404 (2007)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    B. Hoppe, É Tardos, The quickest transshipment problem. Math. Oper. Res. 25(1), 36–62 (2000)Google Scholar
  12. 12.
    B. Klinz, G.J. Woeginger, Minimum-cost dynamic flows: the series-parallel case. Networks 43(3), 153–162 (2004)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    R. Koch, M. Skutella, Nash equilibria and the price of anarchy for flows over time, in Proceedings of tje 2nd International Symposium on Algorithmic Game Theory, vol. 5814, Lecture Notes in Computer Science, pp. 323–334 (2009)Google Scholar
  14. 14.
    D. Manlove, Algorithmics of matching under preferences (World Scientific Publishing, Singapore, 2013)Google Scholar
  15. 15.
    J.B. Orlin, A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41(2), 338–350 (1993)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    A.E. Roth, A.O. Sotomayor, Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis (Cambridge University Press, Cambridge, 1992)Google Scholar
  17. 17.
    A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency (Springer, Berlin, 2003)Google Scholar
  18. 18.
    M. Skutella, An introduction to network flows over time, in Research Trends in Combinatorial Optimization (Springer, Berlin, 2009), pp. 451–482Google Scholar

Copyright information

© Springer Japan 2014

Authors and Affiliations

  1. 1.Institute of Mathematics for IndustryKyushu UniversityNishi-ku, FukuokaJapan

Personalised recommendations