Authors
Éva Tardos
Publication date
1985/9
Journal
Combinatorica
Volume
5
Issue
3
Pages
247-255
Publisher
Springer-Verlag
Description
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.
Total citations
1985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024361671410131711716585973664161410161216917121721161115211716231814
Scholar articles
É Tardos - Combinatorica, 1985