algorithm and the proposed formulations are compared in terms of quality of the linear relaxation and computation time over instances from OR-Library. [4/4 of https://t.co/4LT25xDMa9]
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 [3/4 of https://t.co/4L
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 [2/4 of https://t.co/4LT
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 [1/4 of https://t.co/4LT2