Data networks
Minimum concave-cost network flow problems: applications, complexity, and algorithms
Annals of Operations Research
Practical Bilevel Optimization: Algorithms and Applications (Nonconvex Optimization and Its Applications)
| Hi-index | 0.00 |
The Network Design Problem has been studied extensively and in many of these models the cost is assumed to be a concave function of the loads on the links. In this paper we investigate under which conditions this is indeed the case for the communication networks. The result is presented as a theorem, the Concavity Theorem, and a list of conditions that can easily be verified. It is also shown how the theorem can be extended to other applications, like in the area of road transportation.