In telecommunications, the Ring Design Problem (RDP) lies at the heart
of metropolitan area network design. We propose an integer programmin
g formulation for the RDP, as well as several ring construction and po
st-optimization heuristics. These heuristics are tested and compared o
n a series of test problems.