Compact MILP formulations for the p-center problem - Archive ouverte HAL Access content directly
Book Sections Year : 2018

Compact MILP formulations for the p-center problem


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 this problem we propose two new and compact integer formulations. Our first formulation is an improvement of a previous formulation. It significantly decreases the number of constraints while preserving the optimal value of the linear relaxation. Our second formulation contains less variables and constraints but it has a weaker linear relaxation bound. We besides introduce an algorithm which enables us to compute strong bounds and significantly reduce the size of our formulations. Finally, the efficiency of the algorithm and the proposed formulations are compared in terms of quality of the linear relaxation and computation time over instances from OR-Library.
Fichier principal
Vignette du fichier
pcenters_isco.pdf (299.03 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01811455 , version 1 (07-01-2021)



Zacharie Alès, Sourour Elloumi. Compact MILP formulations for the p-center problem. Jon Lee; Giovanni Rinaldi; A. Ridha Mahjoub. Combinatorial Optimization, 10856, Springer, pp.14-25, 2018, Lecture Notes in Computer Science, 978-3-319-96151-4. ⟨10.1007/978-3-319-96151-4_2⟩. ⟨hal-01811455⟩
212 View
100 Download



Gmail Facebook Twitter LinkedIn More