Skip to Main content Skip to Navigation
New interface
Preprints, Working Papers, ...

An efficient Benders decomposition for the p-median problem

Abstract : 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata
Contributor : Cristian Duran-Mateluna Connect in order to contact the contributor
Submitted on : Wednesday, December 8, 2021 - 4:57:42 PM
Last modification on : Wednesday, September 28, 2022 - 5:59:48 AM


An efficient Benders decomposi...
Files produced by the author(s)


  • HAL Id : hal-03450829, version 2
  • ARXIV : 2111.13405


Cristian Durán Mateluna, Zacharie Alès, Sourour Elloumi. An efficient Benders decomposition for the p-median problem. 2021. ⟨hal-03450829v2⟩



Record views


Files downloads