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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universiti Utara Malaysia
2004
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/1042/1/V._A._Nguyen.pdf |