Linear convolution of criteria in the vector $p$-center problem

We investigate a linear convolution of criteria and possibility of its application for finding Pareto set in the vector variant of the well-known combinatorial $p$-center problem. The polynomial algorithm which transforms any vector $p$-center problem to a solvable problem with the same Pareto set is proposed. An example which illustrates the work of algorithm is performed.