| 2008 |
|---|
| 12 | EE | Mourad Baïou,
Francisco Barahona:
On the p-median polytope of Y-free graphs.
Discrete Optimization 5(2): 205-219 (2008) |
| 11 | EE | Mourad Baïou,
Francisco Barahona:
A linear programming approach to increasing the weight of all minimum spanning trees.
Networks 52(4): 227-234 (2008) |
| 2007 |
|---|
| 10 | EE | Mourad Baïou,
Michel Balinski:
Characterizations of the optimal stable allocation mechanism.
Oper. Res. Lett. 35(3): 392-402 (2007) |
| 2006 |
|---|
| 9 | EE | Mourad Baïou,
José R. Correa:
The node-edge weighted 2-edge connected subgraph problem: Linear relaxation, facets and separation.
Discrete Optimization 3(2): 123-135 (2006) |
| 2005 |
|---|
| 8 | EE | Mourad Baïou,
José R. Correa:
The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation.
Electronic Notes in Discrete Mathematics 19: 103-109 (2005) |
| 2004 |
|---|
| 7 | EE | Mourad Baïou,
Michel Balinski:
Student admissions and faculty recruitment.
Theor. Comput. Sci. 322(2): 245-265 (2004) |
| 2002 |
|---|
| 6 | EE | Mourad Baïou,
Michel Balinski:
The Stable Allocation (or Ordinal Transportation) Problem.
Math. Oper. Res. 27(3): 485-503 (2002) |
| 5 | EE | Mourad Baïou,
Michel Balinski:
Erratum: The Stable Allocation (or Ordinal Transportation) Problem.
Math. Oper. Res. 27(4): 662-680 (2002) |
| 2001 |
|---|
| 4 | | Mourad Baïou:
On the dominant of the Steiner 2-edge connected subgraph polytope.
Discrete Applied Mathematics 112(1-3): 3-10 (2001) |
| 2000 |
|---|
| 3 | | Mourad Baïou,
Michel Balinski:
Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry).
Discrete Applied Mathematics 101(1-3): 1-12 (2000) |
| 2 | EE | Mourad Baïou,
Francisco Barahona,
Ali Ridha Mahjoub:
Separation of Partition Inequalities.
Math. Oper. Res. 25(2): 243-254 (2000) |
| 1997 |
|---|
| 1 | EE | Mourad Baïou,
Ali Ridha Mahjoub:
Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs.
SIAM J. Discrete Math. 10(3): 505-514 (1997) |
