Congress seat allocation using mathematical optimization

Carvajal R, Constantino M, Goycoolea M, Vielma JP, Weintraub A (2013) Imposing connectivity constraints in forest planning models. Oper Res 61(4):824–836

Chopra S, Rao MR (1993) The partitioning problem. Math Program 59:87–115

García S, Cacchiani V, Vanhaverbeke L, Bischoff M (2014) The table placement problem: a research challenge at the EWI 2007. TOP 22(1):208–226

Hess SW, Weaver JB, Siegfeldt JN, Whelan HJ, Zitlau PA (1965) Nonpartisan political redistricting by computer. Oper Res 13(6):998–1006

Hojati M (1996) Optimal political districting. Comput Oper Res 23(12):1147–1161

Horn DL, Hampton CR, Vandenberg AJ (1993) Practical application of district compactness. Polit Geogr 12(2):103–120

Kalcsics J, Nickel S, Schröder M (2005) Towards a unified territorial design approach—applications, algorithms and GIS integration. Top 13(1):1–56

Kernighan BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49:291–307

Niemi RG, Grofman B, Carlucci C, Hofeller T (1990) Measuring compactness and the role of a compactness standard in a test for partisan and racial gerrymandering. J Polit 52(4):1155–1181

Ricca F, Scozzari A, Simeone B (2011) Political districting: from classical models to recent approaches. 4OR Q J Oper Res 9:223–254

Serafini P (2012) Allocation of the EU parliament seats via integer linear programming and revised quotas. Math Soc Sci 63:107–113

Wang Y, Buchanan A, Butenko S (2017) On imposing connectivity constraints in integer programs. Math Program 166(1–2):241–271

Wolkowicz H, Zhao Q (1999) Semidefinite programming relaxations for the graph partitioning problem. Discret Appl Math 96–97:461–479