SciELO - Scientific Electronic Library Online

vol.19 issue2Time-frequency methods based on the wavelet transformNew geometrical compactness measures for zones design author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand




Related links

  • Have no similar articlesSimilars in SciELO


Revista de Matemática Teoría y Aplicaciones

Print version ISSN 1409-2433


DIAZ GARCIA, Juan Antonio et al. Lagrangean relaxation for the geographical partitioning problema  . Rev. Mat [online]. 2012, vol.19, n.2, pp.169-181. ISSN 1409-2433.

Among methodologies used in territory clustering, stand locationallocation and set partitioning models, to group small geographic areas, usually called “basic units” into a given number of larger groups called “territories”. The territory clustering problem is modeled as a p-median problem. A Lagrangean relaxation is used to obtain lower bounds to the optimal solution of the problem and a procedure is used to obtain upper bounds. In order to evaluate the performance of the proposed procedure, instances of two Mexico cities are used. The results obtained with the proposed method are compared to partitioning methods from the literature. According to the obtained results for the considered instances using different number of groups, optimal or near optimal solution are obtained with a reasonable amount of computer effort.

Keywords : partitioning; Lagrangean relaxation; heuristics.

        · abstract in Spanish     · text in Spanish     · Spanish ( pdf )


Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License