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 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Cost Effective Network Flow Measurement for Software Defined Networks: A Distributed Controller Scenario
由: Tahaei, Hamid, et al.
出版: (2018) -
Cost Effective Network Flow Measurement for Software Defined Networks: A Distributed Controller Scenario
由: Tahaei, Hamid, et al.
出版: (2018) -
A combined higher order non-convex total variation with overlapping group sparsity for Poisson noise removal
由: Adam, Tarmizi, et al.
出版: (2022) -
Study of cost functions in three term backpropagation for classification problems
由: Kuppusamy, Puspadevi
出版: (2008) -
Distance computation between convex objects using axis-aligned bounding-box in virtual environment application
由: Sulaiman, Hamzah Asyrani, et al.
出版: (2013)