most citedOptimizing Representation in Redistricting: Dual Bounds for Partitioning Problems with Non-Convex Objectives

1 citations · 1 across the 1 of their papers we have counts for

collaborators
Showing math.OCShow all

2 papers · 1 filter

math.OC2026★ 1 cited

Optimizing Representation in Redistricting: Dual Bounds for Partitioning Problems with Non-Convex Objectives

Jamie Fravel, Robert Hildebrand, Nicholas Goedert +2

We investigate optimization models for the purpose of computational redistricting. Our focus is on nonconvex objectives for estimating expected Black Representatives and Political…

math.OC2024

Continuous Equality Knapsack with Probit-Style Objectives

Jamie Fravel, Robert Hildebrand, Laurel Travis

We study continuous, equality knapsack problems with uniform separable, non-convex objective functions that are continuous, antisymmetric about a point, and have concave and convex…