Some Remarks on Convex Network Flows for K-Spiders
We consider convex functions modeling flows in an arborescent network. The notion of majorization on trees is used to study some classical convexity results in this framework.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2015-01-01
|
| Series: | Mathematical Problems in Engineering |
| Online Access: | http://dx.doi.org/10.1155/2015/710516 |