Linear programming to approximate quadratic 0-1 maximization problems. - Alain Billionnet; Frédéric Roupin (ACM Southeast Regional Conference, 1997)

On Approximating the Memory-Constrained Module Allocation Problem. - Frédéric Roupin (Inf. Process. Lett., 1997)

A greedy algorithm for multicut and integral multiflow in rooted trees. - Marie-Christine Costa; Lucas Létocart; Frédéric Roupin (Oper. Res. Lett., 2003)

From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems. - Frédéric Roupin (J. Comb. Optim., 2004)

A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem. - Alain Faye; Frédéric Roupin (ESA, 2005)

Minimal multicut and maximal integer multiflow: A survey. - Marie-Christine Costa; Lucas Létocart; Frédéric Roupin (Eur. J. Oper. Res., 2005)

Algorithmes Combinatoires et Relaxations par Programmation Linéaire et Semidéfinie. Application à la Résolution de Problèmes Quadratiques et d'Optimisation dans les Graphes. - Frédéric Roupin (2006)

Erratum to "A greedy algorithm for multicut and integral multiflow in rooted tress" [Oper. Res. Lett 31(1) (2003) 21-27]. - Marie-Christine Costa; Lucas Létocart; Frédéric Roupin (Oper. Res. Lett., 2006)

Partial Lagrangian relaxation for general quadratic programming. - Alain Faye; Frédéric Roupin (4OR, 2007)

Erratum to "Minimal multicut and maximal integer multiflow: A survey" [European Journal of Operational Research 162 (1) (2005) 55-69]. - Cédric Bentz; Marie-Christine Costa; Lucas Létocart; Frédéric Roupin (Eur. J. Oper. Res., 2007)

Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs. - Cédric Bentz; Marie-Christine Costa; Frédéric Roupin (J. Discrete Algorithms, 2007)

Multicuts and integral multiflows in rings. - Cédric Bentz; Marie-Christine Costa; Lucas Létocart; Frédéric Roupin (Eur. J. Oper. Res., 2009)

Semidefinite relaxations of the quadratic assignment problem in a Lagrangian framework. - Frédéric Roupin (Int. J. Math. Oper. Res., 2009)

Cardinality constrained and multicriteria (multi)cut problems. - Cédric Bentz; Marie-Christine Costa; Nicolas Derhy; Frédéric Roupin (J. Discrete Algorithms, 2009)

Numerical Study of Semidefinite Bounds for the k-cluster Problem. - Jérôme Malick; Frédéric Roupin (Electron. Notes Discret. Math., 2010)

Solving k-cluster problems to optimality with semidefinite programming. - Jérôme Malick; Frédéric Roupin (Math. Program., 2012)

On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0-1 quadratic problems leading to quasi-Newton methods. - Jérôme Malick; Frédéric Roupin (Math. Program., 2013)

Improved semidefinite bounding procedure for solving Max-Cut problems to optimality. - Nathan Krislock; Jérôme Malick; Frédéric Roupin (Math. Program., 2014)

Fast machine reassignment. - Franck Butelle; Laurent Alfandari; Camille Coti; Lucian Finta; Lucas Létocart; Gérard Plateau; Frédéric Roupin; Antoine Rozenknop; Roberto Wolfler Calvo (Ann. Oper. Res., 2016)

Computational results of a semidefinite branch-and-bound algorithm for k-cluster. - Nathan Krislock; Jérôme Malick; Frédéric Roupin (Comput. Oper. Res., 2016)

Solving 0-1 Quadratic Problems with Two-Level Parallelization of the BiqCrunch Solver. - Camille Coti; Étienne Leclercq; Frédéric Roupin; Franck Butelle (FedCSIS, 2017)

BiqCrunch: A Semidefinite Branch-and-Bound Method for Solving Binary Quadratic Problems. - Nathan Krislock; Jérôme Malick; Frédéric Roupin (ACM Trans. Math. Softw., 2017)

Allocation de ressources par une méthode hybride machine learning - optimisation en contexte de conteneurs. - Étienne Leclercq; Jonathan Rivalan; Frédéric Roupin; Céline Rouveirol (EGC, 2022)