Combinatorica

, Volume 5, Issue 3, pp 247–255

A strongly polynomial minimum cost circulation algorithm

  • Éva Tardos
Article

DOI: 10.1007/BF02579369

Cite this article as:
Tardos, É. Combinatorica (1985) 5: 247. doi:10.1007/BF02579369

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.

AMS subject classification (1980)

68 E 1068 C 25

Copyright information

© Akadémiai Kiadó 1985

Authors and Affiliations

  • Éva Tardos
    • 1
  1. 1.Research Institute for TelecommunicationBudapestHungary
  2. 2.Institut für Ökonometrie und Op. Res.Universitat BonnBonnWest Germany