An exact algorithm for the p-dispersion problem - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2007

An exact algorithm for the p-dispersion problem


The p-dispersion problem consists in locating p facilities at some n predefined locations, such that the minimum distance between two facilities is as large as possible. In this paper we propose an algorithm based on a combination of two approaches: the determination of cliques in a graph and the solution of mixed integer linear programs. Computational results are reported which prove the efficiency of the method. For example, randomly generated instances with 150 facilities and any values of p or with 300 facilities and p greater than 140 can be solved in less than half an hour of CPU time, on the average. Keywords: Location; clique; integer linear programming; experiments
Not file

Dates and versions

hal-01125259 , version 1 (06-03-2015)


  • HAL Id : hal-01125259 , version 1


Alain Billionnet, Karima Djebali. An exact algorithm for the p-dispersion problem. [Research Report] CEDRIC-07-1127, CEDRIC Lab/CNAM. 2007. ⟨hal-01125259⟩
101 View
0 Download


Gmail Facebook Twitter LinkedIn More