Skip to main content
SpringerLink
Log in

A strongly polynomial minimum cost circulation algorithm

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

A new algorithm is presented for the minimum cost circulation problem. The algorithm is strongly polynomial, that is, the number of arithmetic operations is polynomial in the number of nodes, and is independent of both costs and capacities.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. P. Anstee, A polynomial algorithm forb-matching: an alternative approach,Research Report CORR 83–22, University Waterloo, Waterloo, Ontario, 1983.

    Google Scholar 

  2. W. H. Cunningham andA. Frank, A primal dual algorithm for submodular flows;Mathematics of Operations Research,10 (1985), 251–262.

    MATH  MathSciNet  Google Scholar 

  3. E. A. Dinits, Algorithm for solution of a problem of maximum flow in a network with power estimation;Soviet Math. Dokl.,11 (1970), 1277–1280.

    MATH  Google Scholar 

  4. J. Edmonds, Systems of distinct representatives and linear algebra;J. Res. Nat. Bur. Standards,71 B (1967), 241–245.

    MathSciNet  Google Scholar 

  5. J. Edmonds, Submodular functions, matroids and certain polyhedra, in:Combinatorial Structures and Applications, (R. K. Guy et al. eds.) 1970 Gordon and Breach, New York 67–87.

    Google Scholar 

  6. J. Edmonds andR. Giles, A min-max relation for submodular functions on graphs,Annals of Discrete Math. 1 (1977), 185–204.

    Article  MathSciNet  Google Scholar 

  7. J. Edmonds andR. M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems,J. ACM 19 (1972), 248–264.

    Article  MATH  Google Scholar 

  8. L. R. Ford, jr. andD. R. Fulkerson,Flows in Networks, Princeton University Press, Princeton N. J., 1962.

    MATH  Google Scholar 

  9. D. R. Fulkerson, An Out-of-Kilter method for minimal cost flow problems,J. Soc. Indust. Appl. Math. 9 (1961), 18–27.

    Article  MATH  Google Scholar 

  10. A. K. Lenstra, H. W. Lenstra, jr. andL. Lovász, Factoring polynomials with rational coefficients,Math. Ann. 261 (1982), 515–534.

    Article  MATH  MathSciNet  Google Scholar 

  11. C. L. Lucchesi andD. H. Younger, A minimax theorem for directed graphs,J. London Math. Soc. 17 (1978), 368–374.

    Article  MathSciNet  Google Scholar 

  12. N. Megiddo, Towards a genuinely polynomial algorithm for linear programming,SIAM J. Comput. 12 (1981), 347–353.

    Article  MathSciNet  Google Scholar 

  13. G. J. Minty, Monotone Networks,Proc. Roy. Soc. London, Ser. A,257 (1960), 194–212.

    Article  MATH  MathSciNet  Google Scholar 

  14. H. Röck, Scaling techniques for minimal cost network flows, in:Discrete Structures and Algorithms, (U. Page ed.) 1980, Carl Hanser, München, 181–191.

    Google Scholar 

Download references

Author information

Author notes

  1. Éva Tardos

    Present address: Institut für Ökonometrie und Op. Res., Universitat Bonn, Bonn, West Germany

Authors and Affiliations

  1. Research Institute for Telecommunication, Gábor Á. u. 65, 1026, Budapest, Hungary

    Éva Tardos

Authors
  1. Éva Tardos
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tardos, É. A strongly polynomial minimum cost circulation algorithm. Combinatorica 5, 247–255 (1985). https://doi.org/10.1007/BF02579369

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02579369

AMS subject classification (1980)

Search

Navigation