Austin Buchanan

23 papers Journal 22
YearRankTypeTitle / Venue / Authors
2025 J jnl
Political Districting to Minimize County Splits.
Oper. Res.
Maral Shahmizad, Austin Buchanan
2025 J jnl
Political Districting to Optimize the Polsby-Popper Compactness Score with Application to Voting Rights.
Oper. Res.
Pietro Belotti, Austin Buchanan, Soraya Ezazipour
2024 J jnl
Linear-size formulations for connected planar graph partitioning and political districting.
Optim. Lett.
Jack Zhang, Hamidreza Validi, Austin Buchanan, Illya V. Hicks
2022 J jnl
Continuous cubic formulations for cluster detection problems in networks.
Math. Program.
Vladimir Stozhkov, Austin Buchanan, Sergiy Butenko, Vladimir Boginski
2022 J jnl
Imposing Contiguity Constraints in Political Districting Models.
Oper. Res.
Hamidreza Validi, Austin Buchanan, Eugene Lykhovyd
2022 J jnl
On Fault-Tolerant Low-Diameter Clusters in Graphs.
INFORMS J. Comput.
Yajun Lu, Hosseinali Salemi, Balabhaskar Balasundaram, Austin Buchanan
2022 J jnl
Political districting to minimize cut edges.
Math. Program. Comput.
Hamidreza Validi, Austin Buchanan
2022 J jnl
Solving the Distance-Based Critical Node Problem.
INFORMS J. Comput.
Hosseinali Salemi, Austin Buchanan
2022 J jnl
Worst-case analysis of clique MIPs.
Math. Program.
Mohammad Javad Naderi, Austin Buchanan, Jose L. Walteros
2021 J jnl
A Bayesian framework for functional calibration of expensive computational models through non-isometric matching.
IISE Trans.
Babak Farmanesh, Arash Pourhabib, Balabhaskar Balasundaram, Austin Buchanan
2020 J jnl
Parsimonious formulations for low-diameter clusters.
Math. Program. Comput.
Hosseinali Salemi, Austin Buchanan
2020 J jnl
The Optimal Design of Low-Latency Virtual Backbones.
INFORMS J. Comput.
Hamidreza Validi, Austin Buchanan
2020 J jnl
Why Is Maximum Clique Often Easy in Practice?
Oper. Res.
Jose L. Walteros, Austin Buchanan
2019 J jnl
A note on "A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs".
Networks
Hamidreza Validi, Austin Buchanan
2018 J jnl
Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph.
Networks
Austin Buchanan, Yiming Wang, Sergiy Butenko
2017 J jnl
On imposing connectivity constraints in integer programs.
Math. Program.
Yiming Wang, Austin Buchanan, Sergiy Butenko
2016 J jnl
Extended formulations for vertex cover.
Oper. Res. Lett.
Austin Buchanan
2016 J jnl
On provably best construction heuristics for hard combinatorial optimization problems.
Networks
Sera Kahruman-Anderoglu, Austin Buchanan, Sergiy Butenko, Oleg A. Prokopyev
2015 J jnl
An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets.
INFORMS J. Comput.
Austin Buchanan, Je Sang Sung, Sergiy Butenko, Eduardo L. Pasiliao
2015 J jnl
Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks.
INFORMS J. Comput.
Anurag Verma, Austin Buchanan, Sergiy Butenko
2014 J jnl
On connected dominating sets of restricted diameter.
Eur. J. Oper. Res.
Austin Buchanan, Je Sang Sung, Vladimir Boginski, Sergiy Butenko
2014 J jnl
Solving maximum clique in sparse graphs: an O(nm+n2
Optim. Lett.
Austin Buchanan, Jose L. Walteros, Sergiy Butenko, Panos M. Pardalos
2014 — ch.
Using GRASP for the Cover by s-Defective Independent Sets Problem.
Examining Robustness and Vulnerability of Networked Systems
Austin Buchanan, Nannan Chen, Xin Ma