Political districting to minimize cut edges
- 26 April 2022
- journal article
- research article
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 14 (4) , 623-672
Abstract
No abstract availableKeywords
This publication has 101 references indexed in Scilit:
- Maximum Flow in Directed Planar Graphs with Vertex CapacitiesAlgorithmica, 2010
- Orbital branchingMathematical Programming, 2009
- On the asymmetric representatives formulation for the vertex coloring problemDiscrete Applied Mathematics, 2008
- Packing and partitioning orbitopesMathematical Programming, 2007
- Applying genetic algorithms to zone designSoft Computing, 2004
- Exploiting orbits in symmetric ILPMathematical Programming, 2003
- Small covering designs by branch-and-cutMathematical Programming, 2003
- Pruning by isomorphism in branch-and-cutMathematical Programming, 2002
- The planar multiterminal cut problemDiscrete Applied Mathematics, 1998
- Simplified Bipartisan Computer RedistrictingStanford Law Review, 1965