On network flow problems with convex cost

Minimum cost flow (MCF) problem is a typical example of network flow problems, for which an additional constraint of cost is added to each flow. Conventional MCF problems consider the cost constraints as linear functions of flow. In this paper, we extend the MCF problem to cover cost functions as st...

全面介绍

Saved in:
书目详细资料
Main Authors: Nguyen, V.A., Tan, Y. P.
格式: Article
语言:English
出版: Universiti Utara Malaysia 2004
主题:
在线阅读:http://repo.uum.edu.my/1042/1/V._A._Nguyen.pdf
http://repo.uum.edu.my/1042/
http://jict.uum.edu.my
标签: 添加标签
没有标签, 成为第一个标记此记录!