Sourour Elloumi

Available identifiers

zbMath Open elloumi.sourourMaRDI QIDQ176417

List of research outcomes

Publication	Date of Publication	Type
Minimizing recovery cost of network optimization problems	2023-12-18	Paper
Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem	2023-09-13	Paper
An efficient Benders decomposition for the \(p\)-median problem	2023-07-10	Paper
Efficient linear reformulations for binary polynomial optimization problems	2023-07-04	Paper
Un Algorithme De Génération De Coupes Pour Le Problème De L’Affectation Quadratique	2023-05-05	Paper
Compact MILP formulations for the $p$-center problem	2023-02-09	Paper
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation	2021-08-11	Paper
Models and algorithms for the product pricing with single-minded customers requesting bundles	2021-05-21	Paper
Optimization of wireless sensor networks deployment with coverage and connectivity constraints	2021-05-05	Paper
Global solution of non-convex quadratically constrained quadratic programs	2019-01-14	Paper
Compact MILP formulations for the \(p\)-center problem	2018-08-17	Paper
Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation	2017-10-04	Paper
Optimal Migration Planning of Telecommunication Equipment	2017-09-12	Paper
Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem	2017-02-01	Paper
Exact quadratic convex reformulations of mixed-integer quadratically constrained problems	2016-08-25	Paper
A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation	2014-07-11	Paper
An efficient compact quadratic convex reformulation for general integer quadratic programs	2013-02-25	Paper
Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths	2012-11-15	Paper
A New Formulation and Resolution Method for the p-Center Problem	2012-06-08	Paper
A computational study for the p-median Problem	2012-05-13	Paper
Extending the QCR method to general mixed-integer programs	2012-02-22	Paper
A tighter formulation of the \(p\)-median problem	2010-03-09	Paper
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method	2009-06-23	Paper
Linear Reformulations of Integer Quadratic Programs	2009-05-13	Paper
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships	2008-12-17	Paper
Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations	2008-11-19	Paper
Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem	2007-03-05	Paper
Designing radio-mobile access networks based on synchronous digital hierarchy rings	2004-11-12	Paper
Best reduction of the quadratic semi-assignment problem	2002-06-17	Paper
Decomposition and linearization for 0-1 quadratic programming	2001-06-14	Paper
An algorithm for finding the \(K\)-best allocations of a tree structured program	1995-07-20	Paper
Placement Des Taches D’Un Programme A Structure Arborescente Sur Un Reseau De Processeurs: Synthese De Resultats Recents	1994-01-01	Paper
Placement de tâches dans un système distribué et dualité lagrangienne	1992-12-14	Paper

Research outcomes over time

This page was built for person: Sourour Elloumi