A mini–max spanning forest approach to the political districting problem (Q3183734): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207720802645246
+Normal rank
@@ Property / OpenAlex ID @@
+W2009527376
@@ Property / OpenAlex ID: W2009527376 / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis and design of electoral systems
@@ Property / cites work: Analysis and design of electoral systems / rank @@
+Normal rank
@@ Property / cites work @@
+A tabu search heuristic and adaptive memory procedure for political districting
+Normal rank
@@ Property / cites work @@
+How easy is local search?
@@ Property / cites work: How easy is local search? / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimization Based Heuristic for Political Districting
+Normal rank
@@ Property / cites work @@
+How to divide a territory? A new simple differential formalism for optimization of set functions
+Normal rank
@@ Property / cites work @@
+A heuristic algorithm for the mini-max spanning forest problem
+Normal rank
@@ Property / cites work @@
+A branch-and-bound algorithm for the mini-max spanning forest problem
+Normal rank