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...
保存先:
主要な著者: | Nguyen, V.A., Tan, Y. P. |
---|---|
フォーマット: | 論文 |
言語: | 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, 等
出版事項: (2018) -
Cost Effective Network Flow Measurement for Software Defined Networks: A Distributed Controller Scenario
著者:: Tahaei, Hamid, 等
出版事項: (2018) -
A combined higher order non-convex total variation with overlapping group sparsity for Poisson noise removal
著者:: Adam, Tarmizi, 等
出版事項: (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, 等
出版事項: (2013)