Skip to main content
SpringerLink
Log in

Solving integer minimum cost flows with separable convex cost objective polynomially

  • Short Papers
  • Chapter
  • First Online:
Netflow at Pisa

Part of the book series: Mathematical Programming Studies ((MATHPROGRAMM,volume 26))

Abstract

A polynomial algorithm is described to solve minimum cost network flow problems with separable convex cost functions on the arcs and integrality restrictions on the flows. The proof generalizes the scaling approach used by Edmonds and Karp for proving polynomiality of the out-of-kilter method for ordinary (linear cost) network flows.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  • J. Edmonds and R.M. Karp, “Theoretical improvements in algorithmic efficiency for network flow problems”, Journal of the Association for Computing Machinery 19 (1972) 248–264.

    MATH  Google Scholar 

  • L.R. Ford and D.R. Fulkerson, Flows in networks (Princeton University Press, Princeton, NJ, 1962).

    MATH  Google Scholar 

  • M. Gondran and M. Minoux, Graphes et algorithmes (Eyrolles, Paris, 1979, English translation: Wiley. New York, 1984).

    MATH  Google Scholar 

  • B. Jaumard and M. Minoux, “Un algorithme pour les problèmes de flots à coût minimum et fonction de coût quadratique”, Internal Report, Centre National d’Etudes des Télécommunications (Paris, 1983).

    Google Scholar 

  • J.L. Kennington and R.V. Helgason, Algorithms for network programming. (Wiley, New York, 1980).

    MATH  Google Scholar 

  • E.L. Lawler, Combinatorial optimization: Networks and matroids, (Holt, Rinehart & Winston, New York, 1976).

    MATH  Google Scholar 

  • M. Minoux, Programmation mathématique: Théorie et algorithmes (Collection Technique et Scientifique des Télécommunications. Dunod, Paris, 1983).

    MATH  Google Scholar 

  • M. Minoux, “A polynomial algorithm for minimum quadratic cost flow problems”, distributed at the International Workshop on Network Flow Optimization: Theory and Practice, Pisa, March 28–31 (1983) (To appear in European Journal of Operational Research).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Applied Mathematics Department, Centre National d’Etudes des Télécommunications, France

    M. Minoux

Authors
  1. M. Minoux
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Gallo Claudio Sandi

Rights and permissions

Reprints and permissions

Copyright information

© 1986 The Mathematical Programming Society, Inc.

About this chapter

Cite this chapter

Minoux, M. (1986). Solving integer minimum cost flows with separable convex cost objective polynomially. In: Gallo, G., Sandi, C. (eds) Netflow at Pisa. Mathematical Programming Studies, vol 26. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121104

Download citation

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

  • Received:

  • Revised:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00922-8

  • Online ISBN: 978-3-642-00923-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation