31 citations · 40 across the 10 of their papers we have counts for
4 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…
On the polyhedron of the K-partitioning problem with representative variables
Zacharie Ales, Arnaud Knippel, Alexandre Pauchet
The K-partitioning problem consists of partitioning the vertices of a graph in K sets so as to minimize a function of the edge weights. We introduce a linear mixed integer formulat…