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.
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.
L.R. Ford and D.R. Fulkerson, Flows in networks (Princeton University Press, Princeton, NJ, 1962).
M. Gondran and M. Minoux, Graphes et algorithmes (Eyrolles, Paris, 1979, English translation: Wiley. New York, 1984).
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).
J.L. Kennington and R.V. Helgason, Algorithms for network programming. (Wiley, New York, 1980).
E.L. Lawler, Combinatorial optimization: Networks and matroids, (Holt, Rinehart & Winston, New York, 1976).
M. Minoux, Programmation mathématique: Théorie et algorithmes (Collection Technique et Scientifique des Télécommunications. Dunod, Paris, 1983).
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).
Author information
Authors and Affiliations
Editor information
Rights 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