THE MAX‐<i>P</i>‐REGIONS PROBLEM*

2011/12/18 by Juan C. Duque, Luc Anselin, Sergio J. Rey · 3 citations
Engineering · Business, Management and Accounting · #Vehicle Routing Optimization Methods #Urban and Freight Transport Logistics #Facility Location and Emergency Management

paper · pdf · doi:10.1111/j.1467-9787.2011.00743.x

Abstract

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.

Citations

• A Survey of Algorithms for Contiguity-constrained Clustering and Related Problems

Cited by

• On the Performance of the Subtour Elimination Constraints Approach for the <i>p</i>‐Regions Problem: A Computational Study
• GeoDa, From the Desktop to an Ecosystem for Exploring Spatial Data
• Modeling intra-city functional regions through spatial interaction analysis: a case study of Chicago

Related

• On the Performance of the Subtour Elimination Constraints Approach for the <i>p</i>‐Regions Problem: A Computational Study
• A Unified Framework for Clustering Constrained Data without Locality Property
• Range-Clustering Queries
• Efficient solutions for weight-balanced partitioning problems
• Massively Parallel and Dynamic Algorithms for Minimum Size Clustering