Abstract
In this paper, we deal with a Steiner Ring Star (SRS) problem arising from the design of survivable telecommunication networks. We develop two mixed integer programming formulations for the SRS problem by implementing MillerTucker-Zemlin (MTZ) and Sarin-Sherali-Bhootra (SSB) subtour elimination constraints, and then apply the reformulationlinearization technique (RLT) to enhance the lower bound obtained by the LP relaxation. By exploiting the ring-star structure of underlying network, we devise some valid inequalities that tighten the LP relaxation. Computational results demonstrate the effectiveness of the proposed solution procedure. Keyword:Steiner Ring Star Problem, Mixed Integer Programming, Reformulation-Linearization Technique 한국경영과학회지 제39권 제1호 2014년 3월
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
