نویسنده
Leggieri, V., Haouari, Mohamed, Triki, C.
تاریخ انتشار
2012-12
محل انتشار
-
Springer Science+Business Media
موضوع
Steiner tree problem, Delay constraints, Branch-and-cut method
نوع
دوره ای
زبان
انگلیسی
دیجیتال
بله
نسخه خطی
خیر
کتابخانه
دانشگاه اوزیغین
شناسه دارایی کتابخانه
1862-4480
شماره ثبت
dd673f99-8ff1-4bab-a0d4-0a4c341a640e
محل کتابخانه
Industrial Engineering
تاریخ
2012-12
یادداشتها
Due to copyright restrictions, the access to the full text of this article is only available via subscription.
متن نمونه
In this paper, we investigate the Steiner tree problem with delays, which is a generalized version of the Steiner tree problem applied to multicast routing. For this challenging combinatorial optimization problem, we present an enhanced directed cut-based MIP formulation and an exact solution method based on a branch-and-cut approach. Our computational study reveals that the proposed approach can optimally solve hard dense instances.
DOI
10.1007/s11590-011-0368-1
Cilt
6
