![]() | ![]() |
| 2010 | ||
|---|---|---|
| 2 | Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Jean Mailfert: The k edge-disjoint 3-hop-constrained paths polytope. Discrete Optimization 7(4): 222-233 (2010) | |
| 1 | Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Mohamed Didi Biha, Jean Mailfert: A branch-and-cut algorithm for the k-edge connected subgraph problem. Networks 55(1): 13-32 (2010) | |
| 1 | Fatiha Bendali | [1] [2] |
| 2 | Mohamed Didi Biha | [1] |
| 3 | Ali Ridha Mahjoub | [1] [2] |
| 4 | Jean Mailfert | [1] [2] |
Data released under the ODC-BY 1.0 license — See also our legal information page