@inproceedings{54366c5c50a94d0ba728faf984ef8ba1,
title = "Compact MILP formulations for the p-center problem",
abstract = "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.",
keywords = "Discrete location, Equivalent formulations, Integer programming, p-center",
author = "Zacharie Ales and Sourour Elloumi",
note = "Publisher Copyright: {\textcopyright} 2018, Springer International Publishing AG, part of Springer Nature.; 5th International Symposium on Combinatorial Optimization, ISCO 2018 ; Conference date: 11-04-2018 Through 13-04-2018",
year = "2018",
month = jan,
day = "1",
doi = "10.1007/978-3-319-96151-4\_2",
language = "English",
isbn = "9783319961507",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "14--25",
editor = "Giovanni Rinaldi and Mahjoub, \{A. Ridha\} and Jon Lee",
booktitle = "Combinatorial Optimization - 5th International Symposium, ISCO 2018, Revised Selected Papers",
}