Austin Buchanan
@austinlbuchanan.bsky.social
Associate Professor of Industrial Engineering & Management. Interests in #orms #networks #districting. Senior Member of INFORMS. Blogs at https://farkasdilemma.wordpress.com/ Website: https://austinlbuchanan.github.io/
Along these lines? arxiv.org/abs/2504.15885
Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
Branch-and-bound algorithms (B&B) and polynomial-time approximation schemes (PTAS) are two seemingly distant areas of combinatorial optimization. We intend to (partially) bridge the gap between them w...
arxiv.org
November 7, 2025 at 12:05 PM
Along these lines? arxiv.org/abs/2504.15885
Preprint now on Optimization-Online optimization-online.org/2025/10/poli...
Political districting to maximize whole counties – Optimization Online
optimization-online.org
October 20, 2025 at 11:41 PM
Preprint now on Optimization-Online optimization-online.org/2025/10/poli...
I should do the same. Let me just log into Canvas to post an announcement… wait… oh 😵💫🫠
October 20, 2025 at 9:27 PM
I should do the same. Let me just log into Canvas to post an announcement… wait… oh 😵💫🫠
Our code and results are available on GitHub. github.com/maralshahmiz... #orms
GitHub - maralshahmizad/Political-Districting-to-Maximize-Whole-Counties
Contribute to maralshahmizad/Political-Districting-to-Maximize-Whole-Counties development by creating an account on GitHub.
github.com
October 13, 2025 at 2:37 PM
Our code and results are available on GitHub. github.com/maralshahmiz... #orms
Finally, we conduct a case study for Tennessee's state house districts and find that the plaintiffs' case in Wygant v. Lee could have been even stronger if our optimization methods had assisted in the drawing of demonstration plans.
October 13, 2025 at 2:36 PM
Finally, we conduct a case study for Tennessee's state house districts and find that the plaintiffs' case in Wygant v. Lee could have been even stronger if our optimization methods had assisted in the drawing of demonstration plans.
Our approach provides easy-to-understand optimality proofs suitable for courts and laypeople. Specifically, it produces a set family with the property that at least one county from each set must be split. This is depicted as a county-level map in which a curve encircles each set.
October 13, 2025 at 2:35 PM
Our approach provides easy-to-understand optimality proofs suitable for courts and laypeople. Specifically, it produces a set family with the property that at least one county from each set must be split. This is depicted as a county-level map in which a curve encircles each set.
The main problem decides which counties to keep whole, and the subproblem coarsens the selected counties and then seeks a feasible plan. We apply the approach to all congressional and legislative instances across the USA, generating plans that are provably optimal.
October 13, 2025 at 2:32 PM
The main problem decides which counties to keep whole, and the subproblem coarsens the selected counties and then seeks a feasible plan. We apply the approach to all congressional and legislative instances across the USA, generating plans that are provably optimal.
To answer this question, we propose integer programming techniques based on combinatorial Benders decomposition.
October 13, 2025 at 2:30 PM
To answer this question, we propose integer programming techniques based on combinatorial Benders decomposition.