Abstract
We address the Multi Layer Hierarchical Ring Network Design Problem. The aim of this problem is to connect nodes that are assigned to different layers using a hierarchy of rings of bounded length. We present a multi-commodity flow based mixed integer linear programming formulation and experimentally evaluate it on various graphs. Instances up to 76 nodes and 281 edges could be solved to optimality.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
