Frédéric Roupin

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems ACM Transactions on Mathematical Software	2018-02-05	Paper
Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster Computers & Operations Research	2016-11-17	Paper
Fast machine reassignment Annals of Operations Research	2016-11-07	Paper
On approximating the memory-constrained module allocation problem Information Processing Letters	2016-05-26	Paper
Improved semidefinite bounding procedure for solving max-cut problems to optimality Mathematical Programming. Series A. Series B	2014-02-25	Paper
On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods Mathematical Programming. Series A. Series B	2013-08-12	Paper
Solving \(k\)-cluster problems to optimality with semidefinite programming Mathematical Programming. Series A. Series B	2012-12-19	Paper
Numerical study of semidefinite bounds for the \(k\)-cluster problem Electronic Notes in Discrete Mathematics	2012-05-13	Paper
Multicuts and integral multiflows in rings European Journal of Operational Research	2009-12-07	Paper
Semidefinite relaxations of the quadratic assignment problem in a Lagrangian framework International Journal of Mathematics in Operational Research	2009-10-12	Paper
Cardinality constrained and multicriteria (multi)cut problems Journal of Discrete Algorithms	2009-04-16	Paper
A deterministic approximation algorithm for the densest \(k\)-subgraph problem International Journal of Operational Research	2008-05-27	Paper
Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs Journal of Discrete Algorithms	2008-05-16	Paper
Partial Lagrangian relaxation for general quadratic programming 4OR	2007-08-31	Paper
Algorithms – ESA 2005 Lecture Notes in Computer Science	2006-06-27	Paper
From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems Journal of Combinatorial Optimization	2005-05-13	Paper
Minimal multicut and maximal integer multiflow: a survey European Journal of Operational Research	2005-02-09	Paper
A greedy algorithm for multicut and integral multiflow in rooted trees Operations Research Letters	2003-05-04	Paper

Research outcomes over time

This page was built for person: Frédéric Roupin