Frédéric Roupin - Citegraph

Author Info

Name	Affiliation	Papers
FRÉDÉRIC ROUPIN	Université Paris 13, Sorbonne Paris Cité,LIPN, CNRS, UMR 7030,Villetaneuse,France	21
Collaborators	Citations	PageRank
18	156	11.79
Referers	Referees	References
248	302	276

Search Limit

100302

Publications (21 rows)

Collaborators (18 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
BiqCrunch: A Semidefinite Branch-and-Bound Method for Solving Binary Quadratic Problems.	6	0.45	2017
Solving 0-1 quadratic problems with two-level parallelization of the BiqCrunch solver	0	0.34	2017
Fast machine reassignment	0	0.34	2016
Computational results of a semidefinite branch-and-bound algorithm for k -cluster	5	0.42	2016
Improved semidefinite bounding procedure for solving Max-Cut problems to optimality.	13	0.57	2014
On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0-1 quadratic problems leading to quasi-Newton methods.	7	0.48	2013
Solving k-cluster problems to optimality with semidefinite programming.	7	0.46	2012
Numerical Study of Semidefinite Bounds for the k-cluster Problem	2	0.37	2010
Semidefinite relaxations of the quadratic assignment problem in a Lagrangian framework	2	0.40	2009
Multicuts and integral multiflows in rings	5	0.42	2009
Cardinality constrained and multicriteria (multi)cut problems	3	0.42	2009
Erratum to "Minimal multicut and maximal integer multiflow: A survey" [European Journal of Operational Research 162 (1) (2005) 55-69]	0	0.34	2007
Partial Lagrangian relaxation for general quadratic programming	13	0.70	2007
Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs	4	0.42	2007
Erratum to “A greedy algorithm for multicut and integral multiflow in rooted tress” [Oper. Res. Lett. 31(1) (2003) 21–27]	0	0.34	2006
Minimal multicut and maximal integer multiflow: A survey	54	2.27	2005
A cutting planes algorithm based upon a semidefinite relaxation for the quadratic assignment problem	4	0.45	2005
From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems.	23	1.10	2004
A greedy algorithm for multicut and integral multiflow in rooted trees	8	0.85	2003
Linear programming to approximate quadratic 0-1 maximization problems	0	0.34	1997
On approximating the memory-constrained module allocation problem	0	0.34	1997