Resumen de Solving large p-median problems

Sergio García Quiles

• By means of a formulation based on set covering constraints it is shown how the p-median problem can be solved using just a small subset of constraints and variables.

  Though very simple, this method is more than competitive in terms of computational times and size of the instances which have been optimally solved. This approach is embedded in a branch-and-bound framework based on dynamic reliability branching. Moreover, problems of size larger than the largest ones solved up to now are solved exactly in this paper (and much more larger for big values of p).