par Carroll, Paula;McGarraghy, Seán;Fortz, Bernard 
;Labbé, Martine
Référence Lecture notes in computer science, 6701 LNCS, page (24-36)
Publication Publié, 2011
;Labbé, Martine Référence Lecture notes in computer science, 6701 LNCS, page (24-36)
Publication Publié, 2011
Article révisé par les pairs
| Résumé : | We 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. |
