In this paper, we consider a single stage un-capacitated min cost flow network and device two novel procedures to obtain very good dual and primal solutions. We demonstrate the working of heuristics on two sample problems. Later we extend the ideas developed to a general min cost flow network problem by solving a representative problem. We further plan to specialize this procedure for single stage capacitated minimum cost flow network problem and general capacitated minimum cost flow problem.
Dual Based Procedure for the Single Stage General Minimum Cost Flow Problem
5 Views
2 Downloads