Sourour Elloumi
Orcid: 0000-0001-6289-7958
According to our database1,
Sourour Elloumi
authored at least 38 papers
between 1995 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024
2023
Comput. Oper. Res., November, 2023
Eur. J. Oper. Res., July, 2023
Comput. Oper. Res., July, 2023
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2023
2022
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
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
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018
2017
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
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
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
Comput. Oper. Res., 2012
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
Proceedings of the Modelling, 2008
2007
Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem.
Math. Program., 2007
2005
Comput. Oper. Res., 2005
2004
INFORMS J. Comput., 2004
2002
Proceedings of the 11th European Signal Processing Conference, 2002
2001
2000
1995
J. Parallel Distributed Comput., 1995