Frédéric Roupin
É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.
499-500
2022
EGC
https://editions-rnti.fr/?inprocid=1002775
conf/f-egc/2022
db/conf/f-egc/egc2022.html#LeclercqRRR22
Nathan Krislock
Jérôme Malick
Frédéric Roupin
BiqCrunch: A Semidefinite Branch-and-Bound Method for Solving Binary Quadratic Problems.
32:1-32:23
2017
43
ACM Trans. Math. Softw.
4
https://doi.org/10.1145/3005345
https://www.wikidata.org/entity/Q113310149
db/journals/toms/toms43.html#KrislockMR17
Camille Coti
Étienne Leclercq
Frédéric Roupin
Franck Butelle
Solving 0-1 Quadratic Problems with Two-Level Parallelization of the BiqCrunch Solver.
445-452
2017
FedCSIS
https://doi.org/10.15439/2017F329
conf/fedcsis/2017
db/conf/fedcsis/fedcsis2017.html#CotiLRB17
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.
133-160
2016
242
Ann. Oper. Res.
1
https://doi.org/10.1007/s10479-015-2082-3
db/journals/anor/anor242.html#ButelleACFLPRRC16
Nathan Krislock
Jérôme Malick
Frédéric Roupin
Computational results of a semidefinite branch-and-bound algorithm for k-cluster.
153-159
2016
66
Comput. Oper. Res.
https://doi.org/10.1016/j.cor.2015.07.008
db/journals/cor/cor66.html#KrislockMR16
Nathan Krislock
Jérôme Malick
Frédéric Roupin
Improved semidefinite bounding procedure for solving Max-Cut problems to optimality.
61-86
2014
143
Math. Program.
1-2
https://doi.org/10.1007/s10107-012-0594-z
db/journals/mp/mp143.html#KrislockMR14
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.
99-124
2013
140
Math. Program.
1
https://doi.org/10.1007/s10107-012-0628-6
db/journals/mp/mp140.html#MalickR13
Jérôme Malick
Frédéric Roupin
Solving k-cluster problems to optimality with semidefinite programming.
279-300
2012
136
Math. Program.
2
https://doi.org/10.1007/s10107-012-0604-1
db/journals/mp/mp136.html#MalickR12
Jérôme Malick
Frédéric Roupin
Numerical Study of Semidefinite Bounds for the k-cluster Problem.
399-406
2010
36
Electron. Notes Discret. Math.
https://doi.org/10.1016/j.endm.2010.05.051
db/journals/endm/endm36.html#MalickR10
Cédric Bentz
Marie-Christine Costa
Lucas Létocart
Frédéric Roupin
Multicuts and integral multiflows in rings.
1251-1254
2009
196
Eur. J. Oper. Res.
3
https://doi.org/10.1016/j.ejor.2008.05.006
db/journals/eor/eor196.html#BentzCLR09
Frédéric Roupin
Semidefinite relaxations of the quadratic assignment problem in a Lagrangian framework.
144-162
2009
1
Int. J. Math. Oper. Res.
1/2
https://doi.org/10.1504/IJMOR.2009.022879
db/journals/ijmor/ijmor1.html#Roupin09
Cédric Bentz
Marie-Christine Costa
Nicolas Derhy
Frédéric Roupin
Cardinality constrained and multicriteria (multi)cut problems.
102-111
2009
7
J. Discrete Algorithms
1
https://doi.org/10.1016/j.jda.2008.04.004
db/journals/jda/jda7.html#BentzCDR09
Alain Faye
Frédéric Roupin
Partial Lagrangian relaxation for general quadratic programming.
75-88
2007
5
4OR
1
https://doi.org/10.1007/s10288-006-0011-7
db/journals/4or/4or5.html#FayeR07
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].
1312
2007
177
Eur. J. Oper. Res.
2
https://doi.org/10.1016/j.ejor.2005.12.034
db/journals/eor/eor177.html#BentzCLR07
Cédric Bentz
Marie-Christine Costa
Frédéric Roupin
Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs.
36-54
2007
5
J. Discrete Algorithms
1
https://doi.org/10.1016/j.jda.2006.03.009
db/journals/jda/jda5.html#BentzCR07
Frédéric Roupin
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
Paris 13 University, France
https://tel.archives-ouvertes.fr/tel-00596215
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].
477
2006
34
Oper. Res. Lett.
4
https://doi.org/10.1016/j.orl.2005.11.002
db/journals/orl/orl34.html#CostaLR06
Marie-Christine Costa
Lucas Létocart
Frédéric Roupin
Minimal multicut and maximal integer multiflow: A survey.
55-69
2005
162
Eur. J. Oper. Res.
1
https://doi.org/10.1016/j.ejor.2003.10.037
db/journals/eor/eor162.html#CostaLR05
Alain Faye
Frédéric Roupin
A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem.
850-861
2005
conf/esa/2005
ESA
https://doi.org/10.1007/11561071_75
db/conf/esa/esa2005.html#FayeR05
Frédéric Roupin
From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems.
469-493
2004
8
J. Comb. Optim.
4
https://doi.org/10.1007/s10878-004-4838-6
db/journals/jco/jco8.html#Roupin04
Marie-Christine Costa
Lucas Létocart
Frédéric Roupin
A greedy algorithm for multicut and integral multiflow in rooted trees.
21-27
2003
31
Oper. Res. Lett.
1
https://doi.org/10.1016/S0167-6377(02)00184-0
db/journals/orl/orl31.html#CostaLR03
Frédéric Roupin
On Approximating the Memory-Constrained Module Allocation Problem.
205-208
1997
61
Inf. Process. Lett.
4
db/journals/ipl/ipl61.html#Roupin97
https://doi.org/10.1016/S0020-0190(97)00008-2
Alain Billionnet
Frédéric Roupin
Linear programming to approximate quadratic 0-1 maximization problems.
171-173
1997
ACM Southeast Regional Conference
https://doi.org/10.1145/2817460.2817503
conf/ACMse/1997
db/conf/ACMse/ACMse1997.html#BillionnetR97
Laurent Alfandari
Cédric Bentz
Alain Billionnet
Franck Butelle
Roberto Wolfler Calvo
Marie-Christine Costa
Camille Coti
Nicolas Derhy
Alain Faye
Lucian Finta
Nathan Krislock
Étienne Leclercq
Lucas Létocart
Jérôme Malick
Gérard Plateau
Jonathan Rivalan
Céline Rouveirol
Antoine Rozenknop