This node is currently not available in KNIME v5.3 — instead we’re showing this page for KNIME v5.2. You can use the version menu in the title bar to permanently switch your preferred version. This will also show the link to the update site.
Max-P Greedy. A greedy algorithm to solve the max-p-region problem.
The so-called max-p regions model (outlined in Duque, Anselin, and Rey 2012) uses a different approach and considers the regionalization problem as an application of integer programming. In addition, the number of regions is determined endogenously.
The algorithm itself consists of a search process that starts with an initial feasible solution and iteratively improves upon it while maintaining contiguity among the elements of each cluster.
The node is based on the package pygeoda and here are related tools and references:
Options
Cluster settings
Views
- This node has no views
Workflows
- No workflows found
Links
- No links available
Developers
You want to see the source code for this node? Click the following button and we’ll use our super-powers to find it for you.