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
Given a set of n areas spatially covering a geographical zone such as a province, forming contiguous...
Given a set of n areas spatially covering a geographical zone such as a province, forming contiguous...
Abstract—Redistricting is the process of dividing a geographic area consisting of spatial units—ofte...
In this paper, we introduce a new spatially constrained clustering problem called the max-p-regions ...
The p-regions problem involves the aggregation or clustering of n small areas into p spatially conti...
The p-regions is a mixed integer programming (MIP) model for the exhaustive clustering of a set of n...
AbstractClustering problems in a complex geographical setting are often required to incorporate the ...
In region building, different models of cluster analysis conform to different theoretical spatial st...
This paper introduces a new p-regions model called the Network-Max-P-Regions (NMPR) model. The NMPR ...
Given a set of points, the Best Region Search problem finds the optimal location of a rectangle of a...
Given a set of points, the Best Region Search problem finds the optimal location of a rectangle of a...
Given a set of points, the Best Region Search problem finds the optimal location of a rectangle of a...
Given a set of points, the Best Region Search problem finds the optimal location of a rectangle of a...
Given a set of points, the Best Region Search problem finds the optimal location of a rectangle of a...
Given a set of points, the Best Region Search problem finds the optimal location of a rectangle of a...
Given a set of n areas spatially covering a geographical zone such as a province, forming contiguous...
Given a set of n areas spatially covering a geographical zone such as a province, forming contiguous...
Abstract—Redistricting is the process of dividing a geographic area consisting of spatial units—ofte...
In this paper, we introduce a new spatially constrained clustering problem called the max-p-regions ...
The p-regions problem involves the aggregation or clustering of n small areas into p spatially conti...
The p-regions is a mixed integer programming (MIP) model for the exhaustive clustering of a set of n...
AbstractClustering problems in a complex geographical setting are often required to incorporate the ...
In region building, different models of cluster analysis conform to different theoretical spatial st...
This paper introduces a new p-regions model called the Network-Max-P-Regions (NMPR) model. The NMPR ...
Given a set of points, the Best Region Search problem finds the optimal location of a rectangle of a...
Given a set of points, the Best Region Search problem finds the optimal location of a rectangle of a...
Given a set of points, the Best Region Search problem finds the optimal location of a rectangle of a...
Given a set of points, the Best Region Search problem finds the optimal location of a rectangle of a...
Given a set of points, the Best Region Search problem finds the optimal location of a rectangle of a...
Given a set of points, the Best Region Search problem finds the optimal location of a rectangle of a...
Given a set of n areas spatially covering a geographical zone such as a province, forming contiguous...
Given a set of n areas spatially covering a geographical zone such as a province, forming contiguous...
Abstract—Redistricting is the process of dividing a geographic area consisting of spatial units—ofte...