#### Filter Results:

#### Publication Year

2007

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- I. Diarrassouba
- 2009

- Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Jean Mailfert
- Discrete Optimization
- 2010

- Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Mohamed Didi Biha, Jean Mailfert
- Networks
- 2010

- I. Diarrassouba, Hakan Kutucu, Ali Ridha Mahjoub
- Electronic Notes in Discrete Mathematics
- 2013

Given a weighted undirected graph G with a set of pairs of terminals {s i , t i }, i = 1, ..., d, and an integer L ≥ 2, the two node-disjoint hop-constrained sur-vivable network design problem (TNHNDP) is to find a minimum weight subgraph of G such that between every s i and t i there exist at least two node-disjoint paths of length at most L. This problem… (More)

- F. Bendali, I. Diarrassouba, M.D. Biha, A.R. Mahjoub, J. Mailfert
- 2007 6th International Workshop on Design and…
- 2007

In this paper we describe a Branch-and-Cut algorithm for the k-edge connected subgraph problem. This problem has applications in the design of survivable telecommunication networks. We introduce a new family of valid inequalities for the associated polytope. We give sufficient conditions for these inequalities to be facet defining and devise separation… (More)

- I. Diarrassouba, Virginie Gabrel, Ali Ridha Mahjoub, Luís Gouveia, Pierre Pesneau
- Networks
- 2016

In this paper, we study the k edge-connected L-hop-constrained network design problem. Given a weighted graph G = (V, E), a set D of pairs of nodes, two integers L ≥ 2 and k ≥ 2, the problem consists in finding a minimum weight subgraph of G containing at least k edge-disjoint paths of length at most L between every pairs {s, t} ∈ D. We consider the problem… (More)

- Ndèye Fatma Ndiaye, Adnan Yassine, I. Diarrassouba
- ICALT
- 2014

- I. Diarrassouba
- Discrete Optimization
- 2017

- I. Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub
- 2016 12th International Conference on the Design…
- 2016

In this paper we consider the k-node-connected subgraph problem. We propose an integer linear programming formulation for the problem and investigate the associated polytope. We introduce further classes of valid inequalities and discuss their facial aspect. We also devise separation routines and discuss some structure properties and reduction operations.… (More)

The survivable k-node-connected network design problem : Valid inequialities and Branch-and-Cut. Abstract In this paper we consider the k-node-connected subgraph problem. We propose an integer linear programming formulation for the problem and investigate the associated polytope. We introduce further classes of valid inequalities and discuss their facial… (More)