API reference¶
Region Methods¶
Model based approaches for aggregating a large set of geographic units (with small footprints) into a smaller number of regions (with large footprints).

AZP involves class offering the implementation of the automatic zoning procedure algorithm. 

The maxpregions involves the aggregation of n areas into an unknown maximum number of homogeneous regions, while ensuring that each region is contiguious and satisfies a minimum threshold value imposed on a predefined spatially extensive attribute. 

Randomly combine a given set of areas into two or more regions based on various constraints. 

Generate a list of RandomRegion instances. 

Solve the regionKmeans problem with the constraint that each cluster forms a spatially connected component. 

Skater is a spatial regionalization algorithm based on spanning tree pruning introduced in [ANCdCF06]. 

Spatially encouraged spectral clustering found in [Wol18]. 

Agglomerative clustering using Ward linkage with a spatial connectivity constraint. 
Locate Methods¶
Exact solution approaches to facility location modeling problems.

Implement the Location Set Covering Problem (LSCP) optimization model and solve it. 

Implement the Location Set Covering Problem  Backup (LSCPB) optimization model and solve it. 

Implement the Maximal Coverage Location Problem (MCLP) optimization model and solve it. 

Implement the \(p\)median optimization model and solve it. 

Implement the PMedian Model with NearFar Cost Allocation and solve it. 

Implement the \(p\)center optimization model and solve it. 

Implement the \(p\)dispersion optimization model and solve it [Kub87]. 