Redistricting without gerrymandering, utilizing the convexity ratio, and other applications to business and industry

DOI10.1002/asmb.2396zbMath1419.91566OpenAlexW2890432973WikidataQ129251671 ScholiaQ129251671MaRDI QIDQ4627103

Abigail Salvadore, James R. Bozeman, Jillian Mori, Sam Hutchins, Matthew C. Davey, Kayla st. Germain, Timothy Nicholson

Publication date: 7 March 2019

Published in: Applied Stochastic Models in Business and Industry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/asmb.2396

zbMATH Keywords

gerrymanderingpolice districting problemterritory designconvexity ratioredistrictingboundary districtselectrical districting problem

Mathematics Subject Classification ID

History, political science (91F10) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Uses Software

• Matlab

Cites Work

• A survey of models and algorithms for winter road maintenance. III: Vehicle routing and depot location for spreading
• A polynomial solution for the Potato-peeling problem
• A simulated annealing genetic algorithm for the electrical power districting problem
• Gerrymandering and Convexity
• Solving a home-care districting problem in an urban setting
• Municipal Solid Waste Collection: An Effective Data Structure For Solving The Sectorization Problem With Local Search Methods
• A simulated annealing approach to police district design
• Unnamed Item
• Unnamed Item

This page was built for publication: Redistricting without gerrymandering, utilizing the convexity ratio, and other applications to business and industry