RT Generic
T1 A p-median problem with distance selection
A1 Benati, Stefano
A1 García, Sergio
A2 Universidad Carlos III de Madrid. Departamento de Estadística, 
AB This paper introduces an extension of the p-median problem and its application to clustering,in which the distance/dissimilarity function between units is calculated as the distance sum onthe q most important variables. These variables are to be chosen from a set of m elements, so anew combinatorial feature has been added to the problem, that we call the p-median modelwith distance selection. This problem has its origin in cluster analysis, often applied tosociological surveys, where it is common practice for a researcher to select the q statisticalvariables they predict will be the most important in discriminating the statistical units beforeapplying the clustering algorithm. Here we show how this selection can be formulated as anon-linear mixed integer optimization mode and we show how this model can be linearized inseveral different ways. These linearizations are compared in a computational study and theresults outline that the radius formulation of the p-median is the most efficient model forsolving this problem.
YR 2012
FD 2012-06
LK https://hdl.handle.net/10016/14672
UL https://hdl.handle.net/10016/14672
LA eng
DS e-Archivo
RD 30 abr. 2024