A mini–max spanning forest approach to the political districting problem (Q3183734): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Analysis and design of electoral systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A tabu search heuristic and adaptive memory procedure for political districting / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: How easy is local search? / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Optimization Based Heuristic for Political Districting / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: How to divide a territory? A new simple differential formalism for optimization of set functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A heuristic algorithm for the mini-max spanning forest problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A branch-and-bound algorithm for the mini-max spanning forest problem / rank | |||
Normal rank | |||
Latest revision as of 01:29, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A mini–max spanning forest approach to the political districting problem |
scientific article |
Statements
A mini–max spanning forest approach to the political districting problem (English)
0 references
21 October 2009
0 references
political districting
0 references
heuristic algorithm
0 references
spanning forest
0 references
mini-max optimisation
0 references
0 references
