@article { author = {KETABI, S.}, title = {NETWORK OPTIMIZATION WITH PIECEWISE LINEAR CONVEX COSTS}, journal = {Iranian Journal of Science}, volume = {30}, number = {3}, pages = {315-323}, year = {2006}, publisher = {Springer}, issn = {2731-8095}, eissn = {2731-8109}, doi = {10.22099/ijsts.2006.2771}, abstract = {The problem of finding the minimum cost multi-commodity flow in an undirected and completenetwork is studied when the link costs are piecewise linear and convex. The arc-path model and overflowmodel are presented to formulate the problem. The results suggest that the new overflow model outperformsthe classical arc-path model for this problem. The classical revised simplex, Frank and Wolf and a heuristicmethod are compared for the problem.}, keywords = {Multi-commodity network flow problem,piecewise linear and convex costs,Arc-path Model,Overflow Model,Frank and Wolfe Method}, url = {https://ijsts.shirazu.ac.ir/article_2771.html}, eprint = {https://ijsts.shirazu.ac.ir/article_2771_6002b5bb53510cdb0aa0a5aae56fab6f.pdf} }