par Carroll, Paula;Fortz, Bernard 
;Labbé, Martine ;McGarraghy, Seán
Editeur scientifique Pahl, Julia;Reiners, Torsten;Vob, Stefan
Référence International Network Optimization Conference(5: June 13-16, 2011: Hamburg, Germany), INOC 2011, Springer, page (327-338)
Publication Publié, 2011-06
;Labbé, Martine ;McGarraghy, SeánEditeur scientifique Pahl, Julia;Reiners, Torsten;Vob, Stefan
Référence International Network Optimization Conference(5: June 13-16, 2011: Hamburg, Germany), INOC 2011, Springer, page (327-338)
Publication Publié, 2011-06
Publication dans des actes
| 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. |
