Improved formulations for the ring spur assignment problem

Abstract

SCOPUS: cp.kInternational audienceWe present two complete integer programming formulations for the ring spur assignment problem. This problem arises in the design of next generation telecommunications networks. We analyse and compare the formulations in terms of compactness, the resulting LP bound and results from a branch and cut implementation. We present our conclusions with computational results. © 2011 Springer-Verlag