Linear-size formulations for connected planar graph partitioning and political districting
From MaRDI portal
Publication:6181361
DOI10.1007/s11590-023-02070-0MaRDI QIDQ6181361
Jack G. Zhang, Hamidreza Validi, Austin Buchanan, Illya V. Hicks
Publication date: 22 January 2024
Published in: Optimization Letters (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Smaller extended formulations for the spanning tree polytope of bounded-genus graphs
- Using separation algorithms to generate mixed integer model reformulations
- On imposing connectivity constraints in integer programs
- Thinning out Steiner trees: a node-based model for uniform edge costs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Political districting to minimize cut edges
- Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond
- Political districting: from classical models to recent approaches
- Local search algorithms for political districting
- A linear-size zero?one programming model for the minimum spanning tree problem in planar graphs
- A dual ascent approach for steiner tree problems on a directed graph
- A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs”
- Imposing Contiguity Constraints in Political Districting Models
- Imposing Connectivity Constraints in Forest Planning Models
- Parameterized Algorithms
- Optimum branchings
- Optimal Political Districting by Implicit Enumeration Techniques
- Matroids and the greedy algorithm
- Combinatorial optimization. Theory and algorithms
- Multiobjective Optimization for Politically Fair Districting: A Scalable Multilevel Approach
