Political districting: from classical models to recent approaches (Q2393445): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-012-1267-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2167696076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4421940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for constructing the weighted Voronoi diagram in the plane / 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: Scheduling to Minimize Interaction Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Political Districting by Implicit Enumeration Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation and Optimization of Electoral Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The square of a chordal graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal political districting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / 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: Metaheuristics: A bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search algorithms for political districting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted Voronoi region algorithms for political districting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Political districting: From classical models to recent approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple criteria districting problemsthe public transportation network pricing system of the Paris region / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mini–max spanning forest approach to the political districting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic algorithm for the mini-max spanning forest problem / rank
 
Normal rank

Latest revision as of 18:24, 6 July 2024

scientific article
Language Label Description Also known as
English
Political districting: from classical models to recent approaches
scientific article

    Statements

    Political districting: from classical models to recent approaches (English)
    0 references
    0 references
    0 references
    0 references
    8 August 2013
    0 references
    0 references
    political districting
    0 references
    territory design
    0 references
    survey
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references