![]() |
| 2007 | ||
|---|---|---|
| 4 | EE | David Huygens, Martine Labbé, Ali Ridha Mahjoub, Pierre Pesneau: The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut. Networks 49(1): 116-133 (2007) |
| 3 | EE | David Huygens, Ali Ridha Mahjoub: Integer programming formulations for the two 4-hop-constrained paths problem. Networks 49(2): 135-144 (2007) |
| 2006 | ||
| 2 | EE | Geir Dahl, David Huygens, Ali Ridha Mahjoub, Pierre Pesneau: On the k edge-disjoint 2-hop-constrained paths polytope. Oper. Res. Lett. 34(5): 577-582 (2006) |
| 2004 | ||
| 1 | EE | David Huygens, Ali Ridha Mahjoub, Pierre Pesneau: Two Edge-Disjoint Hop-Constrained Paths and Polyhedra. SIAM J. Discrete Math. 18(2): 287-312 (2004) |
| 1 | Geir Dahl | [2] |
| 2 | Martine Labbé | [4] |
| 3 | Ali Ridha Mahjoub | [1] [2] [3] [4] |
| 4 | Pierre Pesneau | [1] [2] [4] |