THE MAX‐P‐REGIONS PROBLEM*
提出最大p区域问题，将地理区域聚类为尽可能多的同质区域，要求每个区域的属性值超过预设阈值，并给出混合整数规划模型和启发式解法。
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.