default search action
Frédéric Roupin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c4]É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: 499-500
2010 – 2019
- 2017
- [j18]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): 32:1-32:23 (2017) - [c3]Camille Coti, Étienne Leclercq
Solving 0-1 Quadratic Problems with Two-Level Parallelization of the BiqCrunch Solver. FedCSIS 2017: 445-452 - 2016
- [j17]Franck Butelle, Laurent Alfandari, Camille Coti
Fast machine reassignment. Ann. Oper. Res. 242(1): 133-160 (2016) - [j16]Nathan Krislock
Computational results of a semidefinite branch-and-bound algorithm for k-cluster. Comput. Oper. Res. 66: 153-159 (2016) - 2014
- [j15]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): 61-86 (2014) - 2013
- [j14]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): 99-124 (2013) - 2012
- [j13]Jérôme Malick, Frédéric Roupin:
Solving k-cluster problems to optimality with semidefinite programming. Math. Program. 136(2): 279-300 (2012) - 2010
- [j12]Jérôme Malick, Frédéric Roupin:
Numerical Study of Semidefinite Bounds for the k-cluster Problem. Electron. Notes Discret. Math. 36: 399-406 (2010)
2000 – 2009
- 2009
- [j11]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): 1251-1254 (2009) - [j10]Frédéric Roupin:
Semidefinite relaxations of the quadratic assignment problem in a Lagrangian framework. Int. J. Math. Oper. Res. 1(1/2): 144-162 (2009) - [j9]Cédric Bentz, Marie-Christine Costa, Nicolas Derhy, Frédéric Roupin:
Cardinality constrained and multicriteria (multi)cut problems. J. Discrete Algorithms 7(1): 102-111 (2009) - 2007
- [j8]Alain Faye, Frédéric Roupin:
Partial Lagrangian relaxation for general quadratic programming. 4OR 5(1): 75-88 (2007) - [j7]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): 1312 (2007) - [j6]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): 36-54 (2007) - 2006
- [b1]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. Paris 13 University, France, 2006 - [j5]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): 477 (2006) - 2005
- [j4]Marie-Christine Costa, Lucas Létocart, Frédéric Roupin:
Minimal multicut and maximal integer multiflow: A survey. Eur. J. Oper. Res. 162(1): 55-69 (2005) - [c2]Alain Faye, Frédéric Roupin:
A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem. ESA 2005: 850-861 - 2004
- [j3]Frédéric Roupin:
From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems. J. Comb. Optim. 8(4): 469-493 (2004) - 2003
- [j2]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): 21-27 (2003)
1990 – 1999
- 1997
- [j1]Frédéric Roupin:
On Approximating the Memory-Constrained Module Allocation Problem. Inf. Process. Lett. 61(4): 205-208 (1997) - [c1]Alain Billionnet, Frédéric Roupin:
Linear programming to approximate quadratic 0-1 maximization problems. ACM Southeast Regional Conference 1997: 171-173
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: