Maximum flow Minimum Cost Problem in a Network
No Thumbnail Available
Date
2014-06-06
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Addis Ababa University
Abstract
Maximum ow minimum cost(MFMC) problem combines sending as much ow as possible from
the source node to the sink node with minimum cost.Here the attributes for the network are the
capacity,ow and cost per unit ow of an arc which varies linearly with the amount of ow.The
problem has two special problems namely the shortest path problem and maximum ow problem
for which we set all the capacities and cost are set to be zero respectively.Solving maximum ow
minimum cost involves two steps;_nding the maximum ow and then _nd the minimum cost
using the feasible ow as an input.
Description
Keywords
Maximum-Flow Minimum Cost, S-T Cut, Ford Fulkerson Labeling Algorithm, Network Simplex Algorithm