22 citations · 51 across the 8 of their papers we have counts for
5 papers · 1 filter
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…
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…