The p-median problem

1) The p-median facility location problem.

The p-median problem is one of the most studied problems in Location literature. In (García at al., 2011), we use a radius formulation to solve in an exact way instances with up to 24978 nodes in an efficient way. The resolution algorithm is based on a column generation approach and a dynamic reliability branching rule. The code is scripted in C++ and the solver used is CPLEX 11.0 (Concert Library).

The research material of this paper can be downloaded from here:

• Code: zreduced_code.zip. You will find also a folder containing the heuristic POPSTAR by Resende and Werneck, which is used as a heuristic to get an initial solution for our algorithm in some instances.
• Instances: pmedian_instances.zip.
• All the results of the computational study (including the explicit solutions): zpmedian_computational.zip.