A Solution Procedure for Minimum Convex-Cost Network Flow Problems
Optimization and Control
2016-11-28 v3
Abstract
This paper presents a heuristic algorithm to solve Minimum Convex-Cost Network Flow Problems (MC-CNFP). This solution algorithm is constructed on the concepts of Network Simplex Method (NSM) for minimum cost network flow problem, Convex Simplex Method (CSM) of Zangwill, the decomposition of the convex simplex method and non-linear transformation problem.
Cite
@article{arxiv.1210.7260,
title = {A Solution Procedure for Minimum Convex-Cost Network Flow Problems},
author = {Dewan F Wahid and Ganesh C Ray and Farjana Habiba},
journal= {arXiv preprint arXiv:1210.7260},
year = {2016}
}