5 citations · 8 across the 3 of their papers we have counts for
3 papers
math.OC2023★ 5 cited
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…
math.OC2021
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…
math.OC2014★ 3 cited
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…