Skip to main content
SpringerLink
Log in

Discrete Optimization: Network Flows and Matchings

  • Chapter
  • First Online:
A Mathematical Approach to Research Problems of Science and Technology

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

  • 1856 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms, and Applications (Prentice Hall, Englewood Cliffs, 1993)

    Google Scholar 

  2. J. Bang-Jensen, G.Z. Gutin, Digraphs: Theory, Algorithms and Applications (Springer, New York, 2009)

    Google Scholar 

  3. J. Edmonds, Paths, trees, and flowers. Can. J. Math. 17, 449–467 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  5. L.R. Ford, D.R. Fulkerson, Flows in Networks (Princeton University Press, New Jersey, 1962)

    Google Scholar 

  6. L.R. Ford, D.R. Fulkerson, Constructing maximal dynamic flows from static flows. Oper. Res. 6(3), 419–433 (1958)

    Article  MathSciNet  Google Scholar 

  7. D. Gale, L.S. Shapley, College admissions and the stability of marriage. Am. Math. Monthly 69(1), 9–15 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  8. P. Gärdenfors, Match making: assignments based on bilateral preferences. Behav. Sci. 20(3), 166–173 (1975)

    Article  Google Scholar 

  9. A.V. Goldberg, R.E. Tarjan, A new approach to the maximum-flow problem. J. ACM 35(4), 921–940 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  10. A. Hall, S. Hippler, M. Skutella, Multicommodity flows over time: efficient algorithms and complexity. Theoret. Comput. Sci. 379(3), 387–404 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  11. B. Hoppe, É Tardos, The quickest transshipment problem. Math. Oper. Res. 25(1), 36–62 (2000)

    Google Scholar 

  12. B. Klinz, G.J. Woeginger, Minimum-cost dynamic flows: the series-parallel case. Networks 43(3), 153–162 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  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. D. Manlove, Algorithmics of matching under preferences (World Scientific Publishing, Singapore, 2013)

    Google Scholar 

  15. J.B. Orlin, A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41(2), 338–350 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  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. A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency (Springer, Berlin, 2003)

    Google Scholar 

  18. M. Skutella, An introduction to network flows over time, in Research Trends in Combinatorial Optimization (Springer, Berlin, 2009), pp. 451–482

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics for Industry, Kyushu University, 744 Motooka, Nishi-ku, Fukuoka, 819-0395, Japan

    Naoyuki Kamiyama

Authors
  1. Naoyuki Kamiyama
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Naoyuki Kamiyama .

Editor information

Editors and Affiliations

  1. Kyushu University, Fukuoka, Japan

    Ryuei Nishii

  2. Department of Mathematics, Hokkaido University, Sapporo, Japan

    Shin-ichiro Ei

  3. Kyushu University Institute of Mathematics for Industry, Fukuoka, Japan

    Miyuki Koiso

  4. Kyushu University Institute of Mathematics for Industry, Fukuoka, Japan

    Hiroyuki Ochiai

  5. Kyushu University Institute of Mathematics for Industry, Fukuoka, Japan

    Kanzo Okada

  6. Faculty of Arts and Science, Kyushu University, Fukuoka, Japan

    Shingo Saito

  7. Kyushu University Institute of Mathematics for Industry, Fukuoka, Japan

    Tomoyuki Shirai

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Japan

About this chapter

Cite this chapter

Kamiyama, N. (2014). Discrete Optimization: Network Flows and Matchings. In: Nishii, R., et al. A Mathematical Approach to Research Problems of Science and Technology. Mathematics for Industry, vol 5. Springer, Tokyo. https://doi.org/10.1007/978-4-431-55060-0_23

Download citation

  • DOI: https://doi.org/10.1007/978-4-431-55060-0_23

  • Published:

  • Publisher Name: Springer, Tokyo

  • Print ISBN: 978-4-431-55059-4

  • Online ISBN: 978-4-431-55060-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation