Frédéric Roupin

According to our database1, Frédéric Roupin authored at least 22 papers between 1997 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
BiqCrunch: A Semidefinite Branch-and-Bound Method for Solving Binary Quadratic Problems.
ACM Trans. Math. Softw., 2017

Solving 0-1 Quadratic Problems with Two-Level Parallelization of the BiqCrunch Solver.
Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, 2017

2016
Computational results of a semidefinite branch-and-bound algorithm for k-cluster.
Comput. Oper. Res., 2016

Fast machine reassignment.
Ann. Oper. Res., 2016

2014
Improved semidefinite bounding procedure for solving Max-Cut problems to optimality.
Math. Program., 2014

2013
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., 2013

2012
Solving k-cluster problems to optimality with semidefinite programming.
Math. Program., 2012

2010
Numerical Study of Semidefinite Bounds for the k-cluster Problem.
Electron. Notes Discret. Math., 2010

2009
Cardinality constrained and multicriteria (multi)cut problems.
J. Discrete Algorithms, 2009

Semidefinite relaxations of the quadratic assignment problem in a Lagrangian framework.
Int. J. Math. Oper. Res., 2009

Multicuts and integral multiflows in rings.
Eur. J. Oper. Res., 2009

2007
Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs.
J. Discrete Algorithms, 2007

Erratum to "Minimal multicut and maximal integer multiflow: A survey" [European Journal of Operational Research 162 (1) (2005) 55-69].
Eur. J. Oper. Res., 2007

Partial Lagrangian relaxation for general quadratic programming.
4OR, 2007

2006
Erratum to "A greedy algorithm for multicut and integral multiflow in rooted tress" [Oper. Res. Lett 31(1) (2003) 21-27].
Oper. Res. Lett., 2006

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.
, 2006

2005
Minimal multicut and maximal integer multiflow: A survey.
Eur. J. Oper. Res., 2005

A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem.
Proceedings of the Algorithms, 2005

2004
From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems.
J. Comb. Optim., 2004

2003
A greedy algorithm for multicut and integral multiflow in rooted trees.
Oper. Res. Lett., 2003

1997
On Approximating the Memory-Constrained Module Allocation Problem.
Inf. Process. Lett., 1997

Linear programming to approximate quadratic 0-1 maximization problems.
Proceedings of the 35th Annual Southeast Regional Conference, 1997


  Loading...