The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut

Fatiha Bendali (1) , Ibrahima Diarrassouba , Mohamed Didi Biha , Ali Ridha Mahjoub (1) , Jean Mailfert (1)

1 LIMOS - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes

In this paper we consider the k-edge connected subgraph problem from a polyhedral point of view. We introduce further classes of valid inequalities for the associated polytope, and describe sufficient conditions for these inequalities to be facet defining. We also devise separation routines for these inequalities, and discuss some reduction operations that can be used in a preprocessing phase for the separation. Using these results, we develop a Branch-and-Cut algorithm and present some computational results.

Mots clés: Branch-and-Cut; k-edge connected subgraph; polytope; facet; separation; reduction operations; Branch-and-Cut.

Domaines: Recherche opérationnelle [math.OC]

Fatiha Bendali, Ibrahima Diarrassouba, Mohamed Didi Biha, Ali Ridha Mahjoub, Jean Mailfert. The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut. International Workshop on Design of Reliable Communication Networks (DRCN), Oct 2007, La Rochelle, France. pp.Pages 1 - 8, ⟨10.1109/DRCN.2007.4762290⟩. ⟨hal-00678058⟩