22 citations · 51 across the 8 of their papers we have counts for
9 papers
Variational quantum algorithms for permutation-based combinatorial problems: Optimal ansatz generation with applications to quadratic assignment problems and beyond
Dylan Laplace Mermoud, Andrea Simonetto, Sourour Elloumi
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 o…
A rounding and clustering-based exact algorithm for the p-center problem
Zacharie Ales, Cristian Duran-Matelunaa, Sourour Elloumi
The p-center problem consists in selecting p facilities from a set of possible sites and allocating a set of clients to them in such a way that the maximum distance between a clien…
Optimizing Variational Circuits for Higher-Order Binary Optimization
Zoé Verchère, Sourour Elloumi, Andrea Simonetto
Variational quantum algorithms have been advocated as promising candidates to solve combinatorial optimization problems on near-term quantum computers. Their methodology involves t…
Compact MILP formulations for the -center problem
Zacharie Ales, Sourour Elloumi
The p-center problem consists in selecting p centers among M to cover N clients, such that the maximal distance between a client and its closest selected center is minimized. For t…
An efficient Benders decomposition for the p-median problem
Cristian Durán Mateluna, Zacharie Alès, Sourour Elloumi
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 neare…
A solution robustness approach applied to network optimization problems
Zacharie Ales, Sourour Elloumi
Solution robustness focuses on structural similarities between the nominal solution and the scenario solutions. Most other robust optimization approaches focus on the quality robus…
Novel Approach Towards Global Optimality of Optimal Power Flow Using Quadratic Convex Optimization
Hadrien Godard, Sourour Elloumi, Amélie Lambert +2
Optimal Power Flow (OPF) can be modeled as a non-convex Quadratically Constrained Quadratic Program (QCQP). Our purpose is to solve OPF to global optimality. To this end, we specia…
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
Sourour Elloumi, Amélie Lambert, Arnaud Lazare
We propose a solution approach for the problem (P) of minimizing an unconstrained binary polynomial optimization problem. We call this method PQCR (Polynomial Quadratic Convex Refo…
Using a conic bundle method to accelerate both phases of a quadratic convex reformulation
Alain Billionnet, Sourour Elloumi, Amélie Lambert +1
We present algorithm MIQCR-CB that is an advancement of method MIQCR~(Billionnet, Elloumi and Lambert, 2012). MIQCR is a method for solving mixed-integer quadratic programs and wor…