The problem of finding the minimum cost multi-commodity flow in an undirected and complete network is studied when the link costs are piecewise linear and convex. The arc-path model and overflow model are presented to formulate the problem. The results suggest that the new overflow model outperforms the classical arc-path model for this problem. The classical revised simplex, Frank and Wolf and a heuristic method are compared for the problem.
KETABI, S. (2006). NETWORK OPTIMIZATION WITH PIECEWISE LINEAR CONVEX COSTS. Iranian Journal of Science, 30(3), 315-323. doi: 10.22099/ijsts.2006.2771
MLA
S. KETABI. "NETWORK OPTIMIZATION WITH PIECEWISE LINEAR CONVEX COSTS", Iranian Journal of Science, 30, 3, 2006, 315-323. doi: 10.22099/ijsts.2006.2771
HARVARD
KETABI, S. (2006). 'NETWORK OPTIMIZATION WITH PIECEWISE LINEAR CONVEX COSTS', Iranian Journal of Science, 30(3), pp. 315-323. doi: 10.22099/ijsts.2006.2771
VANCOUVER
KETABI, S. NETWORK OPTIMIZATION WITH PIECEWISE LINEAR CONVEX COSTS. Iranian Journal of Science, 2006; 30(3): 315-323. doi: 10.22099/ijsts.2006.2771
)