Frédéric Roupin

Publication Activity (10 Years)

Years Active: 1997-2022
Publications (10 Years): 5

Top Topics

Combinatorial Optimisation

Top Venues

Ann. Oper. Res.

Comput. Oper. Res.

ACM Trans. Math. Softw.

Publications

Étienne Leclercq, Jonathan Rivalan, Frédéric Roupin, Céline Rouveirol
Allocation de ressources par une méthode hybride machine learning - optimisation en contexte de conteneurs. EGC (2022)
Camille Coti, Étienne Leclercq, Frédéric Roupin, Franck Butelle
Solving 0-1 Quadratic Problems with Two-Level Parallelization of the BiqCrunch Solver. FedCSIS (2017)
Nathan Krislock, Jérôme Malick, Frédéric Roupin
BiqCrunch: A Semidefinite Branch-and-Bound Method for Solving Binary Quadratic Problems. ACM Trans. Math. Softw. 43 (4) (2017)
Franck Butelle, Laurent Alfandari, Camille Coti, Lucian Finta, Lucas Létocart, Gérard Plateau, Frédéric Roupin, Antoine Rozenknop, Roberto Wolfler Calvo
Fast machine reassignment. Ann. Oper. Res. 242 (1) (2016)
Nathan Krislock, Jérôme Malick, Frédéric Roupin
Computational results of a semidefinite branch-and-bound algorithm for k-cluster. Comput. Oper. Res. 66 (2016)
Nathan Krislock, Jérôme Malick, Frédéric Roupin
Improved semidefinite bounding procedure for solving Max-Cut problems to optimality. Math. Program. 143 (1-2) (2014)
Jérôme Malick, Frédéric Roupin
On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0-1 quadratic problems leading to quasi-Newton methods. Math. Program. 140 (1) (2013)
Jérôme Malick, Frédéric Roupin
Solving k-cluster problems to optimality with semidefinite programming. Math. Program. 136 (2) (2012)
Jérôme Malick, Frédéric Roupin
Numerical Study of Semidefinite Bounds for the k-cluster Problem. Electron. Notes Discret. Math. 36 (2010)
Cédric Bentz, Marie-Christine Costa, Nicolas Derhy, Frédéric Roupin
Cardinality constrained and multicriteria (multi)cut problems. J. Discrete Algorithms 7 (1) (2009)
Cédric Bentz, Marie-Christine Costa, Lucas Létocart, Frédéric Roupin
Multicuts and integral multiflows in rings. Eur. J. Oper. Res. 196 (3) (2009)
Frédéric Roupin
Semidefinite relaxations of the quadratic assignment problem in a Lagrangian framework. Int. J. Math. Oper. Res. 1 (1/2) (2009)
Alain Faye, Frédéric Roupin
Partial Lagrangian relaxation for general quadratic programming. 4OR 5 (1) (2007)
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]. Eur. J. Oper. Res. 177 (2) (2007)
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) (2007)
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) (2006)
Marie-Christine Costa, Lucas Létocart, Frédéric Roupin
Minimal multicut and maximal integer multiflow: A survey. Eur. J. Oper. Res. 162 (1) (2005)
Alain Faye, Frédéric Roupin
A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem. ESA (2005)
Frédéric Roupin
From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems. J. Comb. Optim. 8 (4) (2004)
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) (2003)
Frédéric Roupin
On Approximating the Memory-Constrained Module Allocation Problem. Inf. Process. Lett. 61 (4) (1997)
Alain Billionnet, Frédéric Roupin
Linear programming to approximate quadratic 0-1 maximization problems. ACM Southeast Regional Conference (1997)