A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
- 1 July 1986
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 35 (3) , 298-308
- https://doi.org/10.1007/bf01580882
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- A Primal-Dual Algorithm for Submodular FlowsMathematics of Operations Research, 1985
- A Min-Max Relation for Submodular Functions on GraphsPublished by Elsevier ,1977
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972