Relaxation Methods for Network Flow Problems with Convex Arc Costs
- 1 September 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 25 (5), 1219-1243
- https://doi.org/10.1137/0325067
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Distributed Asynchronous Relaxation Methods for Convex Network Flow ProblemsSIAM Journal on Control and Optimization, 1987
- A unified framework for primal-dual methods in minimum cost network flow problemsMathematical Programming, 1985
- On the convergence of a block successive over-relaxation method for a class of linear complementarity problemsPublished by Springer Nature ,1982
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network ProblemsManagement Science, 1974
- On the convergence of sequential minimization algorithmsJournal of Optimization Theory and Applications, 1973
- On search directions for minimization algorithmsMathematical Programming, 1973
- A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost FunctionalsSIAM Journal on Control, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970