 | 2010 |
| 12 |  | 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) |
| 11 |  | 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) |
| 2009 |
| 10 |  | Alain Quilliot,
Fatiha Bendali,
Jean Mailfert:
Extended cooperative networks games.
Discrete Applied Mathematics 157(4): 728-737 (2009) |
| 9 |  | Fatiha Bendali,
Jean Mailfert:
Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron.
J. Comb. Optim. 18(1): 1-22 (2009) |
| 8 |  | Andréa C. Santos,
Fatiha Bendali,
Jean Mailfert,
Christophe Duhamel,
Kean Mean Hou:
Heuristics for Designing Energy-efficient Wireless Sensor Network Topologies.
JNW 4(6): 436-444 (2009) |
| 2008 |
| 7 |  | Fatiha Bendali,
Christophe Duhamel,
Kean Mean Hou,
Jean Mailfert,
Andréa C. Santos:
An Optimization Approach for Designing Wireless Sensor Networks.
NTMS 2008: 1-6 |
| 2007 |
| 6 |  | Alain Quilliot,
Fatiha Bendali,
Jean Mailfert:
Cooperative networks games with elastic demands.
RAIRO - Operations Research 41(4): 345-360 (2007) |
| 2006 |
| 5 |  | Ali Ridha Mahjoub,
Jean Mailfert:
On the independent dominating set polytope.
Eur. J. Comb. 27(4): 601-616 (2006) |
| 2005 |
| 4 |  | Alain Quilliot,
Fatiha Bendali,
Jean Mailfert:
Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité.
RAIRO - Operations Research 39(3): 185-224 (2005) |
| 2002 |
| 3 |  | Fatiha Bendali,
Ali Ridha Mahjoub,
Jean Mailfert:
Composition of Graphs and the Triangle-Free Subgraph Polytope.
J. Comb. Optim. 6(4): 359-381 (2002) |
| 2001 |
| 2 |  | Fatiha Bendali,
Jean Mailfert,
Alain Quilliot:
Tarification par des jeux Coopératifs avec Demandes Élastiques.
RAIRO - Operations Research 35(3): 367-381 (2001) |
| 2000 |
| 1 |  | Fatiha Bendali,
Ali Ridha Mahjoub,
Jean Mailfert:
Composition of graphs and the triangle free subgraph polytope.
Electronic Notes in Discrete Mathematics 5: 19-22 (2000) |