The relax codes for linear minimum cost network flow problems
Open Access
- 1 December 1988
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 13 (1) , 125-190
- https://doi.org/10.1007/bf02288322
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Relaxation methods for problems with strictly convex separable costs and linear constraintsMathematical Programming, 1987
- Relaxation Methods for Network Flow Problems with Convex Arc CostsSIAM Journal on Control and Optimization, 1987
- Distributed Asynchronous Relaxation Methods for Linear Network Flow ProblemsIFAC Proceedings Volumes, 1987
- Distributed relaxation methods for linear network flow problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Distributed Asynchronous Relaxation Methods for Convex Network Flow ProblemsPublished by Defense Technical Information Center (DTIC) ,1984
- A new algorithm for the assignment problemMathematical Programming, 1981
- OPTIMIZATION FOR SPARSE SYSTEMSPublished by Elsevier ,1976
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network ProblemsManagement Science, 1974