THE MAX- P-REGIONS PROBLEM.
ABSTRACT In this paper, we introduce a new spatially constrained clustering problem called the max- p-regions problem. It involves the clustering of a set of geographic areas into the maximum number of homogeneous regions such that the value of a spatially extensive regional attribute is above a pre...
| Publicado en: | Journal of Regional Science Vol. 52; no. 3; pp. 397 - 420 |
|---|---|
| Autores principales: | , , |
| Formato: | Artículo |
| Publicado: |
Wiley-Blackwell
Aug2012
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=ssf&AN=78060607&site=ehost-live header: @attributes: shortDbName: ssf uiTerm: 78060607 longDbName: Social Sciences Full Text (H.W. Wilson) uiTag: AN controlInfo: bkinfo: jinfo: jid: 00224146 RSC jtl: Journal of Regional Science issn: 00224146 maglogo: Y pubinfo: dt: Aug2012 vid: 52 iid: 3 pid: 480 pub: Wiley-Blackwell artinfo: ui: 78060607 10.1111/j.1467-9787.2011.00743.x ppf: 397 ppct: 23 formats: tig: atl: THE MAX- P-REGIONS PROBLEM. aug: au: Duque, Juan C. Anselin, Luc Rey, Sergio J. affil: Research in Spatial Economics (RISE-group), Department of Economics, EAFIT University, Carrera 49 7 Sur-50, Medellin, Colombia. E-mail: GeoDa Center for Geospatial Analysis and Computation, School of Geographical Sciences and Urban Planning, Arizona State University, Tempe, AZ 85287-5302. E-mail: su: Integer programming Mathematical programming Spatial data structures Spatial data infrastructures Partitions (Mathematics) sug: subj: Integer programming Mathematical programming Spatial data structures Spatial data infrastructures Partitions (Mathematics) ab: ABSTRACT In this paper, we introduce a new spatially constrained clustering problem called the max- p-regions problem. It involves the clustering of a set of geographic areas into the maximum number of homogeneous regions such that the value of a spatially extensive regional attribute is above a predefined threshold value. We formulate the max- p-regions problem as a mixed integer programming (MIP) problem, and propose a heuristic solution. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: N holdings: @attributes: islocal: N |
|---|