An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems
- 1 August 1997
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 7 (3) , 853-870
- https://doi.org/10.1137/s1052623495285886
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Chapter 5 Parallel computing in network optimizationPublished by Elsevier ,1995
- A generic auction algorithm for the minimum cost network flow problemComputational Optimization and Applications, 1993
- On the computational behavior of a polynomial-time network flow algorithmMathematical Programming, 1992
- Finding Minimum-Cost Circulations by Successive ApproximationMathematics of Operations Research, 1990
- Dual coordinate step methods for linear network flow problemsMathematical Programming, 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
- A unified framework for primal-dual methods in minimum cost network flow problemsMathematical Programming, 1985
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972