Research in Operations Research- Reuven Chen

TAU_P_CENTER - Original Relaxation Algorithm

Versions that require CPLEX

CPLEX_tau_p_center_discrete - This C code can be used in order to optimally solve the discrete version of the P-center problem, where the set of demand points and the set of potential service points are the same. For more information, read the README file.

CPLEX_tau_p_center_discrete_euc - This C code can be used in order to optimally solve the discrete version of the P-center problem, where the distances between the demand points and the potential service points are Euclidean. We also assume that the set of demand points and the set of potential service points are the same. For more information, read the README file.

CPLEX_tau_p_center_cont_euc - This C code can be used in order to optimally solve the continuous version of the P-center problem, where the distances are Euclidean. For more information, read the README file.

Versions that do not require CPLEX (far less efficient)

tau_p_center_discrete - This C code can be used in order to optimally solve the discrete version of the P-center problem, where the set of demand points and the set of potential service points are the same. For more information, read the README file.

tau_p_center_discrete_euc - This C code can be used in order to optimally solve the discrete version of the P-center problem, where the distances between the demand points and the potential service points are Euclidean. We also assume that the set of demand points and the set of potential service points are the same. For more information, read the README file.

tau_p_center_cont_euc - This C code can be used in order to optimally solve the continuous version of the P-center problem, where the distances are Euclidean. For more information, read the README file.