reading group on districting

If you’re interested in joining the reading group, please contact prof. Marcus Ritt or Alex Gliesch. They will inform you about the location and the background needed for participation.

Papers

Date Paper
Nov 11, 2021, 13h Miyazawa et al., Partitioning a graph into balanced connected classes: Formulations, separation and experiments, EJOR 2021
Oct 21, 2021, 13h Pessoa et al., Automation and combination of linear-programming based stabilization techniques in column generation, INFORMS J. Comput. 2018
Jun 23, 2021, 15h15 Validi & Buchanan, Political districting to minimize cut edges, Optim. Onl. 2021
Jun 10, 2021, 15h Ceselli & Righini, A Branch-and-Price Algorithm for the Capacitated p-Median Problem, Networks 2005
Jun 2, 2021, 15h15 Gnägi & Baumann, A matheuristic for large-scale capacitated clustering, COR 2021
May 5, 2021, 10h Gurnee & Shmoys, Fairmandering: A column generation heuristic for fairness-optimized political districting, arXiv 2021
May 22, 2020, 9h Validi et al., Imposing contiguity constraints in political districting models, Optim. Onl. 2020
Dec 12, 2019, 10h Ríos-Mercado & Salazar-Acosta, A GRASP w. Strategic Oscillation for a Commercial TDP with a Routing Budget Constraint, MICAI 2011
Oct 17, 2019, 10h Cordeau et al., Benders Decomposition for Very Large Scale Partial Set Covering and Maximal Covering Problems, Optim. Onl. 2018
Aug 6, 2019, 14h Hirose et al., Goal programming approach for political districting in Santa Catarina State: Brazil, Ann. Oper. Res. 2019
Jul 3, 2019, 16h30 Demetriou et al., A Parcel Shape Index for Use in Land Consolidation Planning, Trans GIS 2013
Mar 18, 2019, 16h30 Reuter-Oppermann et al., OR meets need related planning: Approaches for locating general practitioners’ practices, PLOS ONE 2019
Dec 3, 2018, 16h Butsch et al., Districting for Arc Routing, INFORMS 2014
Nov 11, 2018, 14h Muyldermans et al., Districting for salt spreading operations, EJOR 2002
Oct 5, 2018, 10h Schnepper et al., Exact algorithms for handling outliers in center location problems on networks using k-max functions, EJOR 2019
Aug 17, 2018, 10h Moreno et al., A hybrid k-means and IP method for commercial territory design: a case study in meat distribution, Ann. Oper. Res. 2017
Jul 13, 2018, 10h Mehrotra et al., An optimization based heuristic for political districting, Manag. Sci. 1998
Jul 2, 2018, 10h King et al., Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning, Oper. Res. 2012
Jun 8, 2018, 10h Lai & Hao, Iterated maxima search for the maximally diverse grouping problem, EJOR 2016
May 25, 2018, 15h Huerta-Muñoz et al., An iterated greedy heuristic for a market segmentation problem with multiple attributes, EJOR 2017
May 10, 2018, 15h Brieden et al., Constrained clustering via diagrams: A unified theory and its application to electoral district design, EJOR 2017
Apr 30, 2018, 15h Lari et al., Partitioning a graph into c.c.’s w. fixed centers and optimizing cost‐based obj. funcs. or equipartition criteria, Networks 2015
Apr 13, 2018, 15h Bender et al., A B&P algorithm for the scheduling of customer visits in the context of multi-period service TD, EJOR 2018


Queue: districting

Paper Included Deadline¹
Jarrah & Bard, Large-scale pickup and delivery work area design, COR 2012 Oct 26, 2021  
Liberatore et al., Equity in the Police Districting Problem Balancing Territorial and Racial Fairness in Patrolling Operations, J. Quant. Criminol. 2021 May 17, 2021  
Zhou et al., A Heuristic Algorithm for solving a large-scale real-world territory design problem, Omega 2021 May 8, 2021  
Diglio et al., Solutions for districting problems with chance-constrained balancing requirements, Omega 2021 May 8, 2021  
DeFord et al., Recombination: A family of Markov chains for redistricting, arXiv 2019 May 5, 2021  
Akitaya et al., Reconfiguration of Connected Graph Partitions, arXiv 2019 May 5, 2021  
Wøhlk & Laporte, A districting-based heuristic for the coordinated capacitated arc routing problem, COR 2019 May 5, 2021  
Swamy et al., Multi-Objective Optimization for Political Districting: A Scalable Multilevel Approach, Optim. Onl. 2019 May 5, 2021  
Sandoval et al., An Improved Exact Algorithm for a Territory Design Problem with p-Center-Based Dispersion Minimization, Expert Syst. Appl. 2019 May 5, 2021  


Queue: miscellaneous

Paper Included Deadline¹
Avella et al., Computational study of large-scale p-Median problems, Math. Program. 2007 May 24, 2021  
Fleszar & Hindi, An effective VNS for the capacitated p-median problem, EJOR 2008 May 24, 2021  
Hojny et al., Mixed-integer programming techniques for the connected max-k-cut problem, Math. Prog. Comp. 2021 May 11, 2021  
Hansen et al., Solving large p-median clustering problems by primal–dual variable neighborhood search, Data Min. Knowl. Discov. 2009 May 5, 2021  


¹Deadline is two months after last time it received votes or was proposed.

Queue Graveyard