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

Fatiha Bendali, Ibrahima Diarrassouba, Mohamed Didi Biha, Ali Ridha Mahjoub, Jean Mailfert. The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut. In 6th International Workshop on Design and Reliable Communication Networks, DRCN 2007, La Rochelle, France, October 7-10, 2007. pages 1-8, IEEE, 2007. [doi]

Abstract

Abstract is missing.