نویسنده
Mrad, M., Haouari, Mohamed
تاریخ انتشار
2008-10-15
محل انتشار
-
Elsevier
موضوع
Network design, Synthesis of capacitated networks, Multicommodity flows, Constraint generation
نوع
دوره ای
زبان
انگلیسی
دیجیتال
بله
نسخه خطی
خیر
کتابخانه
دانشگاه اوزیغین
شناسه دارایی کتابخانه
0096-3003
شماره ثبت
4ac4c14c-3777-4f60-aaca-c7c28b013b82
محل کتابخانه
Industrial Engineering
تاریخ
2008-10-15
یادداشتها
Due to copyright restrictions, the access to the full text of this article is only available via subscription.
متن نمونه
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.
DOI
10.1016/j.amc.2008.07.031
Cilt
204
