 | 2009 |
|---|
| 11 |       | Cédric Bentz,
Marie-Christine Costa,
Lucas Létocart,
Frédéric Roupin:
Multicuts and integral multiflows in rings.
European Journal of Operational Research 196(3): 1251-1254 (2009) |
| 10 | | Cédric Bentz,
Marie-Christine Costa,
Nicolas Derhy,
Frédéric Roupin:
Cardinality constrained and multicriteria (multi)cut problems.
J. Discrete Algorithms 7(1): 102-111 (2009) |
| 2007 |
|---|
| 9 | | Alain Faye,
Frédéric Roupin:
Partial Lagrangian relaxation for general quadratic programming.
4OR 5(1): 75-88 (2007) |
| 8 | | Cédric Bentz,
Marie-Christine Costa,
Lucas Létocart,
Frédéric Roupin:
Erratum to "Minimal multicut and maximal integer multiflow: A survey" [European Journal of Operational Research 162 (1) (2005) 55-69].
European Journal of Operational Research 177(2): 1312 (2007) |
| 7 | | Cédric Bentz,
Marie-Christine Costa,
Frédéric Roupin:
Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs.
J. Discrete Algorithms 5(1): 36-54 (2007) |
| 2006 |
|---|
| 6 | | Marie-Christine Costa,
Lucas Létocart,
Frédéric Roupin:
Erratum to "A greedy algorithm for multicut and integral multiflow in rooted tress" [Oper. Res. Lett 31(1) (2003) 21-27].
Oper. Res. Lett. 34(4): 477 (2006) |
| 2005 |
|---|
| 5 | | Alain Faye,
Frédéric Roupin:
A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem.
ESA 2005: 850-861 |
| 4 | | Marie-Christine Costa,
Lucas Létocart,
Frédéric Roupin:
Minimal multicut and maximal integer multiflow: A survey.
European Journal of Operational Research 162(1): 55-69 (2005) |
| 2004 |
|---|
| 3 | | Frédéric Roupin:
From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems.
J. Comb. Optim. 8(4): 469-493 (2004) |
| 2003 |
|---|
| 2 | | Marie-Christine Costa,
Lucas Létocart,
Frédéric Roupin:
A greedy algorithm for multicut and integral multiflow in rooted trees.
Oper. Res. Lett. 31(1): 21-27 (2003) |
| 1997 |
|---|
| 1 | | Frédéric Roupin:
On Approximating the Memory-Constrained Module Allocation Problem.
Inf. Process. Lett. 61(4): 205-208 (1997) |
