#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2007

2017

- This year (2)
- Last 5 years (11)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- I. Diarrassouba
- 2009

- I. Diarrassouba, Ali Lourimi, Ali Ridha Mahjoub, Habib Youssef
- Computer Networks
- 2013

- 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, 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

- Ibrahima Diarrassouba, Hakan Kutucu, A. Ridha Mahjoub, CAHIER DU
- 2013

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

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

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

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, investigate the structural properties of the linear relaxation… (More)

- I. Diarrassouba
- Discrete Optimization
- 2017