کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4634220 | 1340688 | 2008 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Optimal solution of the discrete cost multicommodity network design problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Optimal solution of the discrete cost multicommodity network design problem Optimal solution of the discrete cost multicommodity network design problem](/preview/png/4634220.png)
چکیده انگلیسی
We investigate a multicommodity network design problem where a discrete set of technologies with step-increasing cost and capacity functions should be installed on the edges. This problem is a fundamental network design problem having many important applications in contemporary telecommunication networks. We describe an exact constraint generation approach and we show that the conjunctive use of valid inequalities, bipartition inequalities that are generated using max-flow computations, as well as an exact separation algorithm of metric inequalities makes it feasible to solve to optimality instances with up to 50 nodes and 100 edges.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 204, Issue 2, 15 October 2008, Pages 745–753
Journal: Applied Mathematics and Computation - Volume 204, Issue 2, 15 October 2008, Pages 745–753
نویسندگان
Mehdi Mrad, Mohamed Haouari,