A strongly polynomial minimum cost circulation algorithm
- Cite this article as:
- Tardos, É. Combinatorica (1985) 5: 247. doi:10.1007/BF02579369
- 888 Downloads
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 10 68 C 25
Unable to display preview. Download preview PDF.