Compact MILP formulations for the p-center problem
From MaRDI portal
Publication:6425930
DOI10.1007/978-3-319-96151-4_2arXiv2302.04591MaRDI QIDQ6425930FDOQ6425930
Authors: Zacharie Ales, Sourour Elloumi 
Publication date: 9 February 2023
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.
This page was built for publication: Compact MILP formulations for the $p$-center problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6425930)
