Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Optimization pp 185–204Cite as

Minimum Cost Flows

  • Chapter

  • 1032 Accesses

Part of the book series: Algorithms and Combinatorics ((AC,volume 21))

Abstract

In this chapter we show how we can take edge costs into account. For example, in our application of the Maximum Flow Problem to the Job Assignment Problem mentioned in the introduction of Chapter 8 one could introduce edge costs to model that the employees have different salaries; our goal is to meet a deadline when all jobs must be finished at a minimum cost. Of course, there are many more applications.

This is a preview of subscription content, 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   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

General Literature

  • Ahuja, R.K., Magnanti, T.L., and Orlin, J.B. [1993]: Network Flows. Prentice-Hall, Engle-wood Cliffs 1993

    MATH  Google Scholar 

  • Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., and Schrijver, A. [1998]: Combinatorial Optimization. Wiley, New York 1998, Chapter 4

    MATH  Google Scholar 

  • Goldberg, A.V., Tardos, É., and Tarjan, R.E. [1990]: Network flow algorithms. In: Paths, Flows, and VLSI-Layout (B. Korte, L. Lovász, H.J. Prömel, A. Schrijver, eds.), Springer, Berlin 1990, pp. 101–164

    Google Scholar 

  • Gondran, M., and Minoux, M. [1984]: Graphs and Algorithms. Wiley, Chichester 1984, Chapter 5

    MATH  Google Scholar 

  • Jungnickel, D. [1999]: Graphs, Networks and Algorithms. Springer, Berlin 1999, Chapter 9

    Book  Google Scholar 

  • Lawler, E.L. [1976]: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York 1976, Chapter 4

    MATH  Google Scholar 

  • Ruhe, G. [1991]: Algorithmic Aspects of Flows in Networks. Kluwer Academic Publishers, Dordrecht 1991

    Book  MATH  Google Scholar 

Cited References

  • Armstrong, R.D., and Jin, Z. [1997]: A new strongly polynomial dual network simplex algorithm. Mathematical Programming 78 (1997), 131–148

    MathSciNet  MATH  Google Scholar 

  • Busacker, R.G., and Gowen, P.J. [1961]: A procedure for determining a family of minimum-cost network flow patterns. ORO Technical Paper 15, Operational Research Office, Johns Hopkins University, Baltimore 1961

    Google Scholar 

  • Edmonds, J., and Karp, R.M. [1972]: Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM 19 (1972), 248–264

    Article  MATH  Google Scholar 

  • Ford, L.R., and Fulkerson, D.R. [1962]: Flows in Networks. Princeton University Press, Princeton 1962

    MATH  Google Scholar 

  • Gale, D. [1957]: A theorem on flows in networks. Pacific Journal of Mathematics 7 (1957), 1073–1082

    Article  MathSciNet  MATH  Google Scholar 

  • Goldberg, A.V., and Tarjan, R.E. [1989]: Finding minimum-cost circulations by cancelling negative cycles. Journal of the ACM 36 (1989), 873–886

    Article  MathSciNet  MATH  Google Scholar 

  • Grötschel, M., and Lovász, L. [1995]: Combinatorial optimization. In: Handbook of Combinatorics; Vol. 2 (R.L. Graham, M. Grötschel, L. Lovász, eds.), Elsevier, Amsterdam 1995

    Google Scholar 

  • Hassin, R. [1983]: The minimum cost flow problem: a unifying approach to dual algorithms and a new tree-search algorithm. Mathematical Programming 25 (1983), 228–239

    Article  MathSciNet  MATH  Google Scholar 

  • Hitchcock, F.L. [1941]: The distribution of a product from several sources to numerous localities. Journal of Mathematical Physics 20 (1941), 224–230

    MathSciNet  Google Scholar 

  • Hoffman, A.J. [1960]: Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. In: Combinatorial Analysis (R.E. Bellman, M. Hall, eds.), AMS, Providence 1960, pp. 113–128

    Chapter  Google Scholar 

  • Iri, M. [1960]: A new method for solving transportation-network problems. Journal of the Operations Research Society of Japan 3 (1960), 27–87

    Google Scholar 

  • Jewell, W.S. [1958]: Optimal flow through networks. Interim Technical Report 8, MIT 1958

    Google Scholar 

  • Klein, M. [1967]: A primal method for minimum cost flows, with applications to the assignment and transportation problems. Management Science 14 (1967), 205–220

    Article  MATH  Google Scholar 

  • Orden, A. [1956]: The transshipment problem. Management Science 2 (1956), 276–285

    Article  MathSciNet  MATH  Google Scholar 

  • Ore, O. [1956]: Studies on directed graphs I. Annals of Mathematics 63 (1956), 383–406

    Article  MathSciNet  Google Scholar 

  • Orlin, J.B. [1993]: A faster strongly polynomial minimum cost flow algorithm. Operations Research 41 (1993), 338–350

    Article  MathSciNet  MATH  Google Scholar 

  • Orlin, J.B. [1997]: A polynomial time primal network simplex algorithm for minimum cost flows. Mathematical Programming 78 (1997), 109–129

    MathSciNet  MATH  Google Scholar 

  • Orlin, J.B., Plotkin, S.A., and Tardos, É. [1993]: Polynomial dual network simplex algorithms. Mathematical Programming 60 (1993), 255–276

    Article  MathSciNet  MATH  Google Scholar 

  • Plotkin, S.A., and Tardos, É. [1990]: Improved dual network simplex. Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms (1990), 367-376

    Google Scholar 

  • Schulz, A.S., Weismantel, R., and Ziegler, G.M. [1995]: 0/1-Integer Programming: optimization and augmentation are equivalent. In: Algorithms — ESA’ 95; LNCS 979 (P. Spirakis, ed.), Springer, Berlin 1995, pp. 473–483

    Chapter  Google Scholar 

  • Vygen, J. [2000]: On dual minimum cost flow algorithms. Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing (2000), 117-125; to appear in Mathematical Methods of Operations Research

    Google Scholar 

  • Wagner, H.M. [1959]: On a class of capacitated transportation problems. Management Science 5 (1959), 304–318

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Discrete Mathematics, University of Bonn, Lennéstraße 2, 53113, Bonn, Germany

    Bernhard Korte & Jens Vygen

Authors
  1. Bernhard Korte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jens Vygen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Korte, B., Vygen, J. (2002). Minimum Cost Flows. In: Combinatorial Optimization. Algorithms and Combinatorics, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21711-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-21711-5_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-21713-9

  • Online ISBN: 978-3-662-21711-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation