Dual coordinate step methods for linear network flow problems
- 1 April 1988
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 42 (1-3) , 203-243
- https://doi.org/10.1007/bf01589405
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- A Fast and Simple Algorithm for the Maximum Flow ProblemOperations Research, 1989
- The auction algorithm: A distributed relaxation method for the assignment problemAnnals of Operations Research, 1988
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow ProblemsOperations Research, 1988
- Relaxation Methods for Network Flow Problems with Convex Arc CostsSIAM Journal on Control and Optimization, 1987
- Distributed Asynchronous Relaxation Methods for Convex Network Flow ProblemsSIAM Journal on Control and Optimization, 1987
- Distributed relaxation methods for linear network flow problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- A distributed asynchronous relaxation algorithm for the assignment problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Complexity of network synchronizationJournal of the ACM, 1985
- A unified framework for primal-dual methods in minimum cost network flow problemsMathematical Programming, 1985
- A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost FunctionalsSIAM Journal on Control, 1973