The following publications are possibly variants of this publication:
- Polyhedral results for two-connected networks with bounded ringsBernard Fortz, Martine Labbé. mp, 93(1):27-54, 2002. [doi]
- The k-node connected subgraph problem: Polyhedral analysis and Branch-and-CutIbrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub, Raouia Taktak. endm, 52:117-124, 2016. [doi]
- The k-edge connected subgraph problem: Valid inequalities and Branch-and-CutFatiha Bendali, Ibrahima Diarrassouba, Mohamed Didi Biha, Ali Ridha Mahjoub, Jean Mailfert. drcn 2007: 1-8 [doi]
- A branch-and-cut algorithm for the ::::k::::-edge connected subgraph problemFatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Mohamed Didi Biha, Jean Mailfert. networks, 55(1):13-32, 2010. [doi]
- Two-edge connectivity with disjunctive constraints: Polyhedral analysis and Branch-and-CutIntesar M. Al-Mudahka, Ibrahima Diarrassouba, Ali Ridha Mahjoub, Raouia Taktak. candie, 184:109585, October 2023. [doi]