| تعداد نشریات | 24 |
| تعداد شمارهها | 874 |
| تعداد مقالات | 7,803 |
| تعداد مشاهده مقاله | 14,220,771 |
| تعداد دریافت فایل اصل مقاله | 12,165,066 |
NETWORK OPTIMIZATION WITH PIECEWISE LINEAR CONVEX COSTS | ||
| Iranian Journal of Science | ||
| مقاله 8، دوره 30، شماره 3، اسفند 2006، صفحه 315-323 اصل مقاله (242.13 K) | ||
| نوع مقاله: Regular Paper | ||
| شناسه دیجیتال (DOI): 10.22099/ijsts.2006.2771 | ||
| نویسنده | ||
| S. KETABI* | ||
| Department of Management, University of Isfahan, I. R. of Iran | ||
| چکیده | ||
| 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. | ||
| کلیدواژهها | ||
| Multi-commodity network flow problem؛ piecewise linear and convex costs؛ Arc-path Model؛ Overflow Model؛ Frank and Wolfe Method | ||
|
آمار تعداد مشاهده مقاله: 1,407 تعداد دریافت فایل اصل مقاله: 1,600 |
||