Note on Weintraub’s Minimum-Cost Circulation Algorithm
- 1 June 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 18 (3) , 579-583
- https://doi.org/10.1137/0218039
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- A strongly polynomial minimum cost circulation algorithmCombinatorica, 1985
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983
- A Primal Algorithm to Solve Network Flow Problems with Convex CostsManagement Science, 1974
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation ProblemsManagement Science, 1967