Page UMA de Sourour Elloumi
Ens/Chercheuse
Responsable du groupe OC
Professeure
Responsable du groupe OC
Professeure
HDR 2002
Doctorat 1991
EMAIL_TEMPLATE
Publications
Articles (revues avec comité de lecture)
Soumis
- Quadratization and convexification in polynomial binary optimization
, , and
soumis
- Robust MILP formulations for the two-stage weighted vertex p-center problem
, , and
soumis
2022
- An efficient Benders decomposition for the p-median problem
, and
European Journal of Operational Research, Elsevier, nov, 2022
- Minimizing recovery cost of network optimization problems
and
Networks, Wiley, aug, 2022
2021
- Optimization of wireless sensor networks deployment with coverage and connectivity constraints
, , , , and
Annals of Operations Research, vol. 298 (1-2), pp. 183-206, Springer Verlag, 2021 - Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
, and
Journal of Global Optimization, vol. 80 (2), pp. 231-248, Springer Verlag, jan, 2021
2020
- Models and Algorithms for the Product Pricing with Single-Minded Customers Requesting Bundles
, , and
Computers and Operations Research, Elsevier, nov, 2020
2019
- Global solution of non-convex quadratically constrained quadratic programs
and
Optimization Methods and Software, vol. 34 (1), pp. 98-114, Taylor & Francis, 2019
2017
- Optimization and simulation for robust railway rolling-stock planning
, , and
Journal of Rail Transport Planning & Management, 2017 - Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation
, , and
INFORMS Journal on Computing, vol. 29 (2), pp. 318 - 331, Institute for Operations Research and the Management Sciences (INFORMS), may, 2017
2016
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
, and
Mathematical Programming, Series A, vol. 1-2 (158), pp. 235-266, Springer, 2016
2014
- A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
, and
Journal of Combinatorial Optimization, vol. 28, pp. 376-399, Springer Verlag, 2014
2013
- An efficient compact quadratic convex reformulation for general integer quadratic programs
, and
Computational Optimization and Applications, vol. 54, pp. 141-162, Springer Verlag, 2013
2012
- Extending the QCR method to the case of general mixed integer programs
, and
Mathematical Programming Computations, vol. 131, pp. 381-401, 2012 - Star p-hub Center Problem and Star p-hub Median Problem with Bounded Path Lengths
and
Computers and Operations Research, vol. 39, pp. 2725-2732, Elsevier, 2012
2010
- A tighter formulation of the p-median problem
Journal of Combinatorial Optimization, vol. 19, pp. 69-83, Springer Verlag, 2010
2009
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
, and
Discrete Applied Mathematics, vol. 157, pp. 1185-1197, Elsevier, 2009
2008
- Linear inequalities among graph invariants: using GraPHedron to uncover optimal relationships
, , , , , , , , and
Computer Networks Journal, vol. 52, pp. 287-298, 2008 - Quadratic 0-1 programming : tightening linear or quadratic convex reformulation by use of relaxations
, and
RAIRO - Operations Research, vol. 42, pp. 103-121, EDP Sciences, 2008
2007
- Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem
and
Mathematical Programming, vol. 109, pp. 55-68, 2007
Chapitre
2018
- Compact MILP formulations for the p-center problem
and
Combinatorial Optimization, vol. 10856, pp. 14-25, Springer, apr, 2018
Conférences internationales avec actes
2022
- Algorithmes de placement optimisé de drones pour la conception de réseaux de communication
, et
Conference on Artificial Intelligence for Defense (CAID) 2022, Conference on Artificial Intelligence for Defense (CAID) 2022 (Rennes), nov 2022 - Global Solution of Quadratic Problems by Interval Methods and Convex Reformulation
, , and
HUGO 2022 - 15th Workshop on Global Optimization (Szeged), 2022
2020
- Semidefinite programming relaxations through quadratic reformulation for box-constrained polynomial optimization problems
, and
2019 6th International Conference on Control, Decision and Information Technologies (CoDIT), pp. 1498-1503, 2019 6th International Conference on Control, Decision and Information Technologies (CoDIT) (Paris), IEEE, jan, 2020
2019
- Novel Approach Towards Global Optimality of Optimal Power Flow Using Quadratic Convex Optimization
, , , and
6th International Conference on Control, Decision and Information Technologies (CoDIT) (Paris), mar, 2019
2018
- Compact MILP formulations for the p-center problem
and
International Symposium on Combinatorial Optimization ISCO 2018 (Marrakech), apr, 2018
2017
- Optimization of wireless sensor networks deployment with coverage and connectivity constraints
, , , and
2017 4th International Conference on Control, Decision and Information Technologies (CoDIT) (Barcelona), IEEE, apr, 2017
2016
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
and
vol. 10043, pp. 726-734, cocoa 2016 (Hong Kong), dec, 2016
Conférences sans actes
2022
- Planification optimisée du déploiement d'un réseau de télécommunication multitechnologie par dispositifs aéroportés sur un théâtre d'opérations extérieures
, , , et
23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (Villeurbanne - Lyon), mar 2022 - Quadratic reformulations for the optimization of pseudo-boolean functions
, , and
International Symposium on Artificial Intelligence and Mathematics ISAIM 2022 (Fort Lauderdale), jan, 2022
2020
- Quadratisation et reformulation convexe pour les polynômes de variables binaires
, et
ROADEF 2019 (Le Havre), fév 2020 - Solving Alternative Current Optimal Power Flow to Global Optimality with Quadratic Reformulation Using Semi-Definite Programming and Branch-and-Bound
, , , and
PGMO days (Palaiseau), jan, 2020 - The Impact of Quadratization in Convexification-Based Resolution of Polynomial Binary Optimization
, , and
PGMO days (Palaiseau), jan, 2020
2019
- Reducing the Adaptation Costs of a Rolling Stock Schedule with Adaptive Solution: the Case of Demand Changes
, , and
vol. 69, pp. 857-876, RailNorrköping 2019. 8th International Conference on Railway Operations Modelling and Analysis (ICROMA) (Norrköping), sep, 2019
2018
- Résolution du problème de suites binaires avec faible autocorrélation à l'aide d'une reformulation quadratique convexe
, et
ROADEF 2018 (Lorient), fév 2018 - Solve Alternative Current Optimal Power Flow to global optimality
, , , and
ISMP 18 (bordeaux), jan, 2018 - Unconstrained 0-1 polynomial optimization through convex quadratic reformulation
, and
ISMP 18 (Bordeaux), jan, 2018
2017
- Global optimisation of binary polynomial programs
, and
PGMO Days (Palaiseau), feb, 2017 - Quadratic convex reformulation for partitioning problems
and
EUROPT 17 (Montreal), 2017 - Solving Optimal Power Flow through reformulation
, , , and
15th EUROPT Workshop on Advances in Continuous Optimization (montréal), jun, 2017
Prépublication
2022
Rapport d'activité
2022
Autres publications
2022
2021
- An efficient Benders decomposition for the p-median problem
, and
dec, 2021