Relaxation Methods for Network Flow Problems with Convex Arc Costs

This publication has 9 references indexed in Scilit:

• Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
  SIAM Journal on Control and Optimization, 1987
• A unified framework for primal-dual methods in minimum cost network flow problems
  Mathematical Programming, 1985
• On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
  Published by Springer Nature ,1982
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
  Management Science, 1974
• On the convergence of sequential minimization algorithms
  Journal of Optimization Theory and Applications, 1973
• On search directions for minimization algorithms
  Mathematical Programming, 1973
• A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
  SIAM Journal on Control, 1973
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
  Journal of the ACM, 1972
• Convex Analysis
  Published by Walter de Gruyter GmbH ,1970