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
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!

相似書籍