Frédéric Roupin

发表

A variable neighborhood search using an interior point descent method for the module allocation problem

Marie-Christine Costa, J. L. Cr mieu, Frédéric Roupin, 2000 .

On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0–1 quadratic problems leading to quasi-Newton methods

Frédéric Roupin, Jérôme Malick, J. Malick, 2013, Math. Program..

Partial Lagrangian relaxation for general quadratic programming

Frédéric Roupin, Alain Faye, Frédéric Roupin, 2007, 4OR.

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

Frédéric Roupin, Lucas Létocart, Marie-Christine Costa, 2006, Oper. Res. Lett..

Improved semidefinite bounding procedure for solving Max-Cut problems to optimality

Frédéric Roupin, Jérôme Malick, Nathan Krislock, 2014, Math. Program..

Une approche semidéfinie pour un problème de placement de tâches avec contraintes de ressources

Frédéric Roupin, 2003 .

Erratum to "Minimal multicut and maximal integer multiflow: A survey" [European Journal of Operational Research 162 (1) (2005) 55-69]

Frédéric Roupin, Cédric Bentz, Lucas Létocart, 2007, Eur. J. Oper. Res..

Numerical Study of Semidefinite Bounds for the k-cluster Problem

Frédéric Roupin, Jérôme Malick, J. Malick, 2010, Electron. Notes Discret. Math..

Minimal multicut and maximal integer multiflow: A survey

Frédéric Roupin, Lucas Létocart, Marie-Christine Costa, 2005, Eur. J. Oper. Res..

Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs

Frédéric Roupin, Cédric Bentz, Marie-Christine Costa, 2007, J. Discrete Algorithms.

A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem

Frédéric Roupin, Alain Faye, Frédéric Roupin, 2005, ESA.

A greedy algorithm for multicut and integral multiflow in rooted trees

Frédéric Roupin, Lucas Létocart, Marie-Christine Costa, 2003, Oper. Res. Lett..

Semidefinite relaxations of the quadratic assignment problem in a Lagrangian framework

Frédéric Roupin, Frédéric Roupin, 2009, Int. J. Math. Oper. Res..

From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems

Frédéric Roupin, Frédéric Roupin, 2004, J. Comb. Optim..

Solving 0-1 quadratic problems with two-level parallelization of the BiqCrunch solver

Camille Coti, Frédéric Roupin, Franck Butelle, 2017, 2017 Federated Conference on Computer Science and Information Systems (FedCSIS).

Multicuts and integral multiflows in rings

Frédéric Roupin, Cédric Bentz, Lucas Létocart, 2009, Eur. J. Oper. Res..

Fast machine reassignment

Camille Coti, Frédéric Roupin, Gérard Plateau, 2016, Ann. Oper. Res..

On Approximating the Memory-Constrained Module Allocation Problem

Frédéric Roupin, Frédéric Roupin, 1997, Inf. Process. Lett..

Cardinality constrained and multicriteria (multi)cut problems

Frédéric Roupin, Cédric Bentz, Nicolas Derhy, 2009, J. Discrete Algorithms.

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

Frédéric Roupin, Frédéric Roupin, 2006 .

Linear programming to approximate quadratic 0-1 maximization problems

Alain Billionnet, Frédéric Roupin, A. Billionnet, 1997, ACM-SE 35.

Multicut and integral multiflow : a survey.

Frédéric Roupin, Marie-Christine Costa, Lucas Létocart, 2004 .

Computational results of a semidefinite branch-and-bound algorithm for k-cluster

Frédéric Roupin, Jérôme Malick, Nathan Krislock, 2016, Comput. Oper. Res..

Solving \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k$$\end{document}-cluster problems to optimality with semidefi

Frédéric Roupin, Jérôme Malick, J. Malick, 2012, Mathematical Programming.

Partial lagrangian and semide nite relax-ations of quadratics programs

Frédéric Roupin, Alain Faye, 2005 .

BiqCrunch

Frédéric Roupin, Jérôme Malick, Nathan Krislock, 2017 .

Improved semidefinite branch-and-bound algorithm for k-cluster

Frédéric Roupin, Jérôme Malick, Nathan Krislock, 2012 .

A deterministic approximation algorithm for the Densest k-Subgraph Problem

Alain Billionnet, Frédéric Roupin, 2008 .

COMPARISON OF DIFFERENT LOWER BOUNDS FOR THE CONSTRAINED MODULE ALLOCATION PROBLEM

Frédéric Roupin, Sourour Elloumi, Eric Soutif, .