Geoscience Reference
In-Depth Information
Gross J, Yellen J (2003) Handbook of graph theory. CRC Press, Boca Raton
Hanafi S, Fréville A, Vaca P (1999) Municipal solid waste collection: an effective data structure
for solving the sectorization problem with local search methods. INFOR 37:236-254
Handley L, Grofmann B (eds) (2008) Redistricting in comparative perspective. Oxford University
Press, New York
Haugland D, Ho S, Laporte G (2007) Designing delivery districts for the vehicle routing problem
with stochastic demands. Eur J Oper Res 180:997-1010
Hess S, Samuels S (1971) Experiences with a sales districting model: criteria and implementation.
Manag Sci 18:41-54
Hess S, Weaver J, Siegfeldt H, Whelan J, Zitlau P (1965) Nonpartisan political redistricting by
computer. Oper Res 13:998-1008
Hojati M (1996) Optimal political districting. Comput Oper Res 23:1147-1161
Horn D, Hampton C, Vandenberg A (1993) Practical application of district compactness. Polit
Geogr 12:103-120
Howick R, Pidd M (1990) Sales force deployment models. Eur J Oper Res 48:295-310
Jarrah A, Bard J (2012) Large-scale pickup and delivery work area design. Comput Oper Res
39:3102-3118
Kalcsics J, Nickel S, Schröder M (2005) Towards a unified territorial design approach -
applications, algorithms and GIS integration. TOP 13:1-74
Lei H, Laporte G, Guo B (2012) Districting for routing with stochastic customers. EURO J Transp
Logist 1:67-85
Lewyn M (1993) How to limit gerrymandering. Florida Law Rev 45:403-486
Lin HY, Kao JJ (2008) Subregion districting analysis for municipal solid waste collection
privatization. J Air Waste Manag Assoc 58:104-111
Lodish L (1975) Sales territory alignment to maximize profit. J Market Res 12:30-36
López-Pérez J, Ríos-Mercado R (2013) Embotelladoras ARCA uses operations research to
improve territory design plans. Interfaces 43:209-220
Mehrotra A, Johnson E, Nemhauser G (1998) An optimization based heuristic for political
districting. Manag Sci 44:1100-1114
Minciardi R, Puliafito PP, Zoppoli R (1981) A districting procedure for social organizations. Eur
J Oper Res 8:47-57
Muyldermans L, Cattrysse D, Van Oudheusden D, Lotan T (2002) Districting for salt spreading
operations. Eur J Oper Res 139:521-532
Muyldermans L, Cattrysse D, Van Oudheusden D (2003) District design for arc-routing applica-
tions. J Oper Res Soc 54:1209-1221
Nagel S (1965) Simplified bipartisan computer redistricting. Stanford Law Rev 17:863-899
Niemi R, 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:1155-1181
Parker F (1990) Black votes count. The University of North Carolina Press, Chapel Hill
Puppe C, Tasnádi A (2008) A computational approach to unbiased districting. Math Comput Model
48:1455-1460
Ricca F, Simeone B (2008) Local search algorithms for political districting. Eur J Oper Res
189:1409-1426
Ricca F, Scozzari A, Simeone B (2008) Weighted Voronoi region algorithms for political
districting. Math Comput Model 48:1468-1477
Ricca F, Scozzari A, Simeone B (2013) Political districting: from classical models to recent
approaches. Ann Oper Res 204:271-299
Ríos-Mercado R, Fernández E (2009) A reactive GRASP for a commercial territory design
problem with multiple balancing requirements. Comput Oper Res 36:755-776
Ríos-Mercado R, López-Pérez J (2013) Commercial territory design planning with realignment
and disjoint assignment requirements. Omega 41:525-535
Ríos-Mercado R, Salazar-Acosta J (2011) A GRASP with strategic oscillation for a commercial
territory design problem with a routing budget constraint. Advances in Soft Computing Lecture
notes in computer science, 10th Mexican International Conference on Artificial Intelligence,
