Yazar
Mrad, M., Haouari, Mohamed
Basım Tarihi
2008-10-15
Basım Yeri
-
Elsevier
Konu
Network design, Synthesis of capacitated networks, Multicommodity flows, Constraint generation
Tür
Süreli Yayın
Dil
İngilizce
Dijital
Evet
Yazma
Hayır
Kütüphane
Özyeğin Üniversitesi
Demirbaş Numarası
0096-3003
Kayıt Numarası
4ac4c14c-3777-4f60-aaca-c7c28b013b82
Lokasyon
Industrial Engineering
Tarih
2008-10-15
Notlar
Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Örnek Metin
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
