Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Optimization pp 215–244Cite as

Minimum Cost Flows

  • Chapter
  • First Online:

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   54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   99.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

Learn about institutional subscriptions

References

General Literature

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

    Google Scholar 

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

    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

    Google Scholar 

  • Jungnickel , D. [2013]: Graphs, Networks and Algorithms. Fourth Edition. Springer, Berlin 2013, Chapters 10 and 11

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • Skutella , M. [2009]: An introduction to network flows over time. In: Research Trends in Combinatorial Optimization (W.J. Cook , L. Lovász , J. Vygen , eds.), Springer, Berlin 2009, pp. 451–482

    Google Scholar 

Cited References

  • Arkin , E.M., and Silverberg , E.B. [1987]: Scheduling jobs with fixed start and end times. Discrete Applied Mathematics 18 (1987), 1–8

    Google Scholar 

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

    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 

  • Cunningham , W.H. [1976]: A network simplex method. Mathematical Programming 11 (1976), 105–116

    Google Scholar 

  • Dantzig , G.B. [1951]: Application of the simplex method to a transportation problem. In: Activity Analysis and Production and Allocation (T.C. Koopmans, Ed.), Wiley, New York 1951, pp. 359–373

    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

    Google Scholar 

  • Fleischer , L., and Skutella , M. [2007]: Quickest flows over time. SIAM Journal on Computing 36 (2007), 1600–1630

    Google Scholar 

  • Ford , L.R., and Fulkerson , D.R. [1958]: Constructing maximal dynamic flows from static flows. Operations Research 6 (1958), 419–433

    Google Scholar 

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

    Google Scholar 

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

    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

    Google Scholar 

  • Goldberg , A.V., and Tarjan , R.E. [1990]: Finding minimum-cost circulations by successive approximation. Mathematics of Operations Research 15 (1990), 430–466

    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

    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

    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

    Google Scholar 

  • Hoppe , B., and Tardos , É. [2000]: The quickest transshipment problem. Mathematics of Operations Research 25 (2000), 36–62

    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 

  • Karzanov , A.V., and McCormick , S.T. [1997]: Polynomial methods for separable convex optimization in unimodular linear spaces with applications. SIAM Journal on Computing 26 (1997), 1245–1275

    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

    Google Scholar 

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

    Google Scholar 

  • Lee , Y.T., and Sidford , A. [2014]: Path finding methods for linear programming. Proceedings of the 55th Annual IEEE Symposium on Foundations of Computer Science (2014), 424–433

    Google Scholar 

  • Matsui , T., and Scheifele , R. [2016]: A linear time algorithm for the unbalanced Hitchcock transportation problem. Networks 67 (2016), 170–182

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    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

    Google Scholar 

  • Schulz , A.S., and Weismantel , R. [2002]: The complexity of generic primal algorithms for solving general integer problems. Mathematics of Operations Research 27 (2002), 681–692

    Google Scholar 

  • Tardos , É. [1985]: A strongly polynomial minimum cost circulation algorithm. Combinatorica 5 (1985), 247–255

    Google Scholar 

  • Tolstoĭ , A.N. [1930]: Metody nakhozhdeniya naimen’shego summovogo kilometrazha pri planirovanii perevozok v prostanstve. In: Planirovanie Perevozok, Sbornik pervyĭ, Transpechat’ NKPS, Moskow 1930, pp. 23–55. (See A. Schrijver , On the history of the transportation and maximum flow problems, Mathematical Programming 91 (2002), 437–445)

    Google Scholar 

  • Tomizawa , N. [1971]: On some techniques useful for solution of transportation network problems. Networks 1 (1971), 173–194

    Google Scholar 

  • Vygen , J. [2002]: On dual minimum cost flow algorithms. Mathematical Methods of Operations Research 56 (2002), 101–126

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Discrete Mathematics, University of Bonn, 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

© 2018 Springer-Verlag GmbH Germany

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

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

Download citation

Publish with us

Policies and ethics

Search

Navigation