The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm
- 1 June 1983
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 25 (2), 228-239
- https://doi.org/10.1007/bf02591772
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A note on the primal-dual and out-of-kilter algorithms for network optimization problemsNetworks, 1977
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation ProblemsManagement Science, 1974
- Implementation and computational comparisons of primal, dual and primal‐dual computer codes for minimum cost network flow problemsNetworks, 1974
- A bad network problem for the simplex method and other minimum cost flow algorithmsMathematical Programming, 1973
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation ProblemsManagement Science, 1967
- An Out-of-Kilter Method for Minimal-Cost Flow ProblemsJournal of the Society for Industrial and Applied Mathematics, 1961