Balanced Min Cost Flow on Skew Symmetric Networks with Convex CostsReport as inadecuate




Balanced Min Cost Flow on Skew Symmetric Networks with Convex Costs - Download this document for free, or read online. Document in PDF available to download.

We consider the solution of matching problems with aconvex cost function via a network flow algorithm. We review the generalmapping between matching problems and flow problems on skew symmetric networksand revisit several results on optimality of network flows. We use these results toderive a balanced capacity scaling algorithm for matching problems witha linear cost function. The latter is later generalized to a balanced capacityscaling algorithm also for a convex cost function. We prove the correctness anddiscuss the complexity of our solution.

KEYWORDS

Matching; Skew Symmetric Network; Convex Cost Function; Optimization

Cite this paper

H. Soller -Balanced Min Cost Flow on Skew Symmetric Networks with Convex Costs,- Open Journal of Discrete Mathematics, Vol. 3 No. 3, 2013, pp. 155-161. doi: 10.4236-ojdm.2013.33028.





Author: Henning Soller

Source: http://www.scirp.org/



DOWNLOAD PDF




Related documents