Sourour Elloumi

Orcid: 0000-0001-6289-7958

According to our database1, Sourour Elloumi authored at least 37 papers between 1995 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Robust MILP formulations for the two-stage weighted vertex p-center problem.
Comput. Oper. Res., November, 2023

An efficient benders decomposition for the p-median problem.
Eur. J. Oper. Res., July, 2023

Efficient linear reformulations for binary polynomial optimization problems.
Comput. Oper. Res., July, 2023

Minimizing recovery cost of network optimization problems.
Networks, January, 2023

Optimizing Variational Circuits for Higher-Order Binary Optimization.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2023

2022
Quadratic reformulations for the optimization of pseudo-boolean functions.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

2021
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation.
J. Glob. Optim., 2021

Models and algorithms for the product pricing with single-minded customers requesting bundles.
Comput. Oper. Res., 2021

Optimization of wireless sensor networks deployment with coverage and connectivity constraints.
Ann. Oper. Res., 2021

2019
Global solution of non-convex quadratically constrained quadratic programs.
Optim. Methods Softw., 2019

Novel Approach Towards Global Optimality of Optimal Power Flow Using Quadratic Convex Optimization.
Proceedings of the 6th International Conference on Control, 2019

Semidefinite programming relaxations through quadratic reformulation for box-constrained polynomial optimization problems.
Proceedings of the 6th International Conference on Control, 2019

2018
Compact MILP Formulations for the p-Center Problem.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2017
Optimization and simulation for robust railway rolling-stock planning.
J. Rail Transp. Plan. Manag., 2017

Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation.
INFORMS J. Comput., 2017

Optimization of wireless sensor networks deployment with coverage and connectivity constraints.
Proceedings of the 4th International Conference on Control, 2017

2016
Exact quadratic convex reformulations of mixed-integer quadratically constrained problems.
Math. Program., 2016

Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
Optimal Migration Planning of Telecommunication Equipment.
Proceedings of the Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, 2015

2014
A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation.
J. Comb. Optim., 2014

Does network coding improve the throughput of a survivable multicast network ?
Proceedings of the 10th International Conference on the Design of Reliable Communication Networks, 2014

2013
An efficient compact quadratic convex reformulation for general integer quadratic programs.
Comput. Optim. Appl., 2013

2012
Extending the QCR method to general mixed-integer programs.
Math. Program., 2012

Star p-hub center problem and star p-hub median problem with bounded path lengths.
Comput. Oper. Res., 2012

2010
A tighter formulation of the <i>p</i>-median problem.
J. Comb. Optim., 2010

A computational study for the p-median Problem.
Electron. Notes Discret. Math., 2010

2009
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method.
Discret. Appl. Math., 2009

2008
Quadratic 0-1 programming: Tightening linear or quadratic convex reformulation by use of relaxations.
RAIRO Oper. Res., 2008

Linear inequalities among graph invariants: Using <i>GraPHedron</i> to uncover optimal relationships.
Networks, 2008

Linear Reformulations of Integer Quadratic Programs.
Proceedings of the Modelling, 2008

2007
Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem.
Math. Program., 2007

2005
Designing radio-mobile access networks based on synchronous digital hierarchy rings.
Comput. Oper. Res., 2005

2004
A New Formulation and Resolution Method for the p-Center Problem.
INFORMS J. Comput., 2004

2002
Local optimization of index assignments for multiple description coding.
Proceedings of the 11th European Signal Processing Conference, 2002

2001
Best reduction of the quadratic semi-assignment problem.
Discret. Appl. Math., 2001

2000
Decomposition and Linearization for 0-1 Quadratic Programming.
Ann. Oper. Res., 2000

1995
An Algorithm for Finding the K-Best Allocations of a Tree Structured Program.
J. Parallel Distributed Comput., 1995


  Loading...