A branch-and-cut algorithm for the Multiple Steiner TSP with Order constraints

Sylvie Borne , Ali Ridha Mahjoub (1) , Raouia Taktak

1 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision

The paper deals with a problem motivated by survivability issues in multilayer IP-over-WDM telecommunication networks. Given a set of traffic demands for which we know a survivable routing in the IP layer, our purpose is to look for the corresponding survivable topology in the WDM layer. The problem amounts to Multiple Steiner TSPs with order constraints. We propose an integer linear programming formulation for the problem and investigate the associated polytope. We also present new valid inequalities and discuss their facial aspect. Based on this, we devise a Branch-and-cut algorithm and present preliminary computational results.

Mots clés: Steiner TSP; travelling salesman problem; IP-over-WDM networks; order constraint; Branch-and-cut algorithm

Domaines: Informatique [cs]

Sylvie Borne, Ali Ridha Mahjoub, Raouia Taktak. A branch-and-cut algorithm for the Multiple Steiner TSP with Order constraints. Electronic Notes in Discrete Mathematics, 2013, 41, ⟨10.1016/j.endm.2013.05.129⟩. ⟨hal-01497003⟩