Sourour Elloumi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Sourour Elloumi has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Amélie Lambert
CEDRIC-CNAM, Paris Cedex 03, France
3 shared publications - Natalia Jorquera-Bravo
UMA, ENSTA Paris, Institut Polytechnique de Paris
3 shared publications - Agnès Plateau
CEDRIC Conservatoire National des Arts et Métiers France
2 shared publications - Cristian Duran-Mateluna2 shared publications
- Zacharie Ales
Unité de Mathématiques Appliquées, École nationale supérieure de techniques avancées Paris, Institut Polytechnique de Paris, 91120 Palaiseau, France
2 shared publications - Agnès Plateau
Conservatoire National des Arts et Métiers/CEDRIC, Paris, France
1 shared publication
Latest Publications
- Open Access
- 9 February 2026
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 10
Variational quantum algorithms for permutation-based combinatorial problems: Optimal ansatz generation with applications to quadratic assignment problems and beyond
We present a quantum variational algorithm based on a novel circuit that generates all permutations that can be spanned by one- and two-qubits permutation gates. The construction of the circuits follows from group-theoretical results, most importantly the Bruhat decomposition of the group generated by the cx gates. These circuits require a number of qubits that scale logarithmically with the permutation dimension, and are therefore employable in near-term applications. We further augment the circuits with ancilla qubits to enlarge their span, and with these we build ansatze to tackle permutation-based optimization problems such as quadratic assignment problems, and graph isomorphisms. The resulting quantum algorithm, QuPer, is competitive with respect to classical heuristics and we could simulate its behavior up to a problem with 256 variables, requiring 20 qubits.
- 9 February 2026
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 10
Open AccessVariational quantum algorithms for permutation-based combinatorial problems: Optimal ansatz generation with applications to quadratic assignment problems and beyond
We present a quantum variational algorithm based on a novel circuit that generates all permutations that can be spanned by one- and two-qubits permutation gates. The construction of the circuits follows from group-theoretical results, most importantly the Bruhat decomposition of the group generated by the cx gates. These circuits require a number of qubits that scale logarithmically with the permutation dimension, and are therefore employable in near-term applications. We further augment the circuits with ancilla qubits to enlarge their span, and with these we build ansatze to tackle permutation-based optimization problems such as quadratic assignment problems, and graph isomorphisms. The resulting quantum algorithm, QuPer, is competitive with respect to classical heuristics and we could simulate its behavior up to a problem with 256 variables, requiring 20 qubits.
- 5 October 2025
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 50 (3) , 1-47
Quadratization and convexification in polynomial binary optimization
- 5 October 2025
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 50 (3) , 1-47
Quadratization and convexification in polynomial binary optimization
- 2 July 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 183
A rounding and clustering-based exact algorithm for the p-center problem
- 2 July 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 183
A rounding and clustering-based exact algorithm for the p-center problem
- 22 May 2024
- Published by Springer Nature
- p. 388-401
Fair Energy Allocation for Collective Self-consumption
- 22 May 2024
- Published by Springer Nature
- p. 388-401
Fair Energy Allocation for Collective Self-consumption
- 12 February 2024
- Published by Springer Nature in Journal of Global Optimization
- Vol. 91 (2) , 331-353
Global solution of quadratic problems using interval methods and convex relaxations
- 12 February 2024
- Published by Springer Nature in Journal of Global Optimization
- Vol. 91 (2) , 331-353
Global solution of quadratic problems using interval methods and convex relaxations
- Open Access
Design and Dimensioning of Natural Gas Pipelines with Hydrogen Injection
The global focus on reducing air pollution and dependence on fossil fuels has led to efforts to shift to renewable energy sources. Hydrogen is a promising alternative due to its high energy capacity and ability to regulate electricity production through electrolysis. In this context, the problem of designing and sizing natural gas pipelines with hydrogen injection is presented. The objective is to establish the network topology and diameter dimensions of each pipeline section for hydrogen distribution, in order to cover the demand at a minimum cost. To address the proposed problem, we consider the dimensioning as the selection of a diameter from a set of available measures, i.e., a discrete diameter approach, and we compare it with a continuous diameter approach from the literature, including a mixed integer nonlinear programming (MINLP) formulation of degree six. In our discrete diameter approach, we propose a non-convex quadratic (MIQLP) model, and we derive a mixed-integer quadratic convex relaxation (MIQCP). Finally, we adapt a Delta Change heuristic to this context. We implement several solution methods for a real case study in France. These include solving the dimensioning problem on a fixed Minimum Spanning Tree topology, considering both continuous and discrete diameters, employing the Delta Change heuristic for both cases, continuous and discrete, and solving the MIQCP relaxation problem. The strengths and weaknesses of each of these proposals are demonstrated through the study.
Open AccessDesign and Dimensioning of Natural Gas Pipelines with Hydrogen Injection
The global focus on reducing air pollution and dependence on fossil fuels has led to efforts to shift to renewable energy sources. Hydrogen is a promising alternative due to its high energy capacity and ability to regulate electricity production through electrolysis. In this context, the problem of designing and sizing natural gas pipelines with hydrogen injection is presented. The objective is to establish the network topology and diameter dimensions of each pipeline section for hydrogen distribution, in order to cover the demand at a minimum cost. To address the proposed problem, we consider the dimensioning as the selection of a diameter from a set of available measures, i.e., a discrete diameter approach, and we compare it with a continuous diameter approach from the literature, including a mixed integer nonlinear programming (MINLP) formulation of degree six. In our discrete diameter approach, we propose a non-convex quadratic (MIQLP) model, and we derive a mixed-integer quadratic convex relaxation (MIQCP). Finally, we adapt a Delta Change heuristic to this context. We implement several solution methods for a real case study in France. These include solving the dimensioning problem on a fixed Minimum Spanning Tree topology, considering both continuous and discrete diameters, employing the Delta Change heuristic for both cases, continuous and discrete, and solving the MIQCP relaxation problem. The strengths and weaknesses of each of these proposals are demonstrated through the study.
- Open Access
Fair Energy Allocation for Collective Self-Consumption
This study explores a collective self-consumption community with several houses, a shared distributed energy resource (DER), and a common energy storage system, as a battery. Each house has an energy demand over a discrete planning horizon, met by using the DER, the battery, or purchasing electricity from the main power grid. Excess energy can be stored in the battery or sold back to the main grid. The objective is to determine a supply plan ensuring a fair allocation of renewable energy while minimizing the overall microgrid cost. We investigate and discuss the formulation of these optimization problems using mixed integer linear programming. We show some dominance properties that allow to reformulate the model into a linear program. We study some fairness metrics like the proportional allocation rule and max-min fairness. Finally, we illustrate our proposal in a real case study in France with up to seven houses and a one-day time horizon with 15minute intervals.
Open AccessFair Energy Allocation for Collective Self-Consumption
This study explores a collective self-consumption community with several houses, a shared distributed energy resource (DER), and a common energy storage system, as a battery. Each house has an energy demand over a discrete planning horizon, met by using the DER, the battery, or purchasing electricity from the main power grid. Excess energy can be stored in the battery or sold back to the main grid. The objective is to determine a supply plan ensuring a fair allocation of renewable energy while minimizing the overall microgrid cost. We investigate and discuss the formulation of these optimization problems using mixed integer linear programming. We show some dominance properties that allow to reformulate the model into a linear program. We study some fairness metrics like the proportional allocation rule and max-min fairness. Finally, we illustrate our proposal in a real case study in France with up to seven houses and a one-day time horizon with 15minute intervals.
- 5 April 2023
- Published by Elsevier in Computers & Operations Research
- Vol. 155
Efficient linear reformulations for binary polynomial optimization problems
- 5 April 2023
- Published by Elsevier in Computers & Operations Research
- Vol. 155
Efficient linear reformulations for binary polynomial optimization problems
- 18 November 2022
- Published by Elsevier in European Journal of Operational Research
- Vol. 308 (1) , 84-96
An efficient benders decomposition for the -median problem- 18 November 2022
- Published by Elsevier in European Journal of Operational Research
- Vol. 308 (1) , 84-96
An efficient benders decomposition for the -median problem- Open Access
An efficient Benders decomposition for the p-median problem
The p-median problem is a classic discrete location problem with several applications. It aims to open p sites while minimizing the sum of the distances of each client to its nearest open site. We study a Benders decomposition of the most efficient formulation in the literature. We prove that the Benders cuts can be separated by a polynomial time algorithm. The Benders decomposition also leads to a new compact formulation for the p-median problem. We implement a branch-and-Benders-cut approach that outperforms state-of-the-art methods on benchmark instances by an order of magnitude.
Open AccessAn efficient Benders decomposition for the p-median problem
The p-median problem is a classic discrete location problem with several applications. It aims to open p sites while minimizing the sum of the distances of each client to its nearest open site. We study a Benders decomposition of the most efficient formulation in the literature. We prove that the Benders cuts can be separated by a polynomial time algorithm. The Benders decomposition also leads to a new compact formulation for the p-median problem. We implement a branch-and-Benders-cut approach that outperforms state-of-the-art methods on benchmark instances by an order of magnitude.