- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j12 |      | Jérôme Malick, Frédéric Roupin: Solving k-cluster problems to optimality with semidefinite programming. Math. Program. 136(2): 279-300 (2012) |
| 2010 | ||
| j11 | | Jérôme Malick, Frédéric Roupin: Numerical Study of Semidefinite Bounds for the k-cluster Problem. Electronic Notes in Discrete Mathematics 36: 399-406 (2010) |
| 2009 | ||
| j10 | | 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) |
| j9 | | 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 | ||
| j8 | | Alain Faye, Frédéric Roupin: Partial Lagrangian relaxation for general quadratic programming. 4OR 5(1): 75-88 (2007) |
| j7 | | 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) |
| j6 | | 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 | ||
| j5 | | 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 | ||
| j4 | | 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) |
| c1 | | Alain Faye, Frédéric Roupin: A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem. ESA 2005: 850-861 |
| 2004 | ||
| j3 | | 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 | ||
| j2 | | 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 | ||
| j1 | | Frédéric Roupin: On Approximating the Memory-Constrained Module Allocation Problem. Inf. Process. Lett. 61(4): 205-208 (1997) |
| 1 | Cédric Bentz | |
| 2 | Marie-Christine Costa | |
| 3 | Nicolas Derhy | |
| 4 | Alain Faye | |
| 5 | Lucas Létocart | |
| 6 | Jérôme Malick |
Data released under the ODC-BY 1.0 license — See also our legal information page