论文信息 - Compact MILP Formulations for the p-Center Problem

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.

Sourour Elloumi | Zacharie Ales

[1] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[2] Hatice Calik,et al. Double bound method for solving the p-center location problem , 2013, Comput. Oper. Res..

[3] Daniele Ferone,et al. On the fast solution of the p-center problem , 2017, 2017 19th International Conference on Transparent Optical Networks (ICTON).

[4] Martine Labbé,et al. A New Formulation and Resolution Method for the p-Center Problem , 2004, INFORMS J. Comput..

[5] Martine Labbé,et al. p-Center Problems , 2015 .

[6] Daniele Ferone,et al. A New Local Search for the p-Center Problem Based on the Critical Vertex Concept , 2017, LION.

[7] Stefan Irnich,et al. A new compact formulation for the discrete p-dispersion problem , 2017, Eur. J. Oper. Res..