The p-dispersion path problem on graphs

Dispersion problems consist in locating facilities as far apart as possible in a given space. Several models have been considered when the facilities can be represented by points, but there are others that need some dimensional structure instead of isolated points. In this paper the p-dispersion path problem is introduced and the possible distances between paths are defined and discussed. Finally, some computational results are described.