Austin Buchanan

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 16

Top Topics

Integer Program

Hard Combinatorial Optimization Problems

Top Venues

INFORMS J. Comput.

Publications

Jack Zhang, Hamidreza Validi, Austin Buchanan, Illya V. Hicks
Linear-size formulations for connected planar graph partitioning and political districting. Optim. Lett. 18 (1) (2024)
Vladimir Stozhkov, Austin Buchanan, Sergiy Butenko, Vladimir Boginski
Continuous cubic formulations for cluster detection problems in networks. Math. Program. 196 (1) (2022)
Yajun Lu, Hosseinali Salemi, Balabhaskar Balasundaram, Austin Buchanan
On Fault-Tolerant Low-Diameter Clusters in Graphs. INFORMS J. Comput. 34 (6) (2022)
Hosseinali Salemi, Austin Buchanan
Solving the Distance-Based Critical Node Problem. INFORMS J. Comput. 34 (3) (2022)
Hamidreza Validi, Austin Buchanan, Eugene Lykhovyd
Imposing Contiguity Constraints in Political Districting Models. Oper. Res. 70 (2) (2022)
Hamidreza Validi, Austin Buchanan
Political districting to minimize cut edges. Math. Program. Comput. 14 (4) (2022)
Mohammad Javad Naderi, Austin Buchanan, Jose L. Walteros
Worst-case analysis of clique MIPs. Math. Program. 195 (1) (2022)
Babak Farmanesh, Arash Pourhabib, Balabhaskar Balasundaram, Austin Buchanan
A Bayesian framework for functional calibration of expensive computational models through non-isometric matching. IISE Trans. 53 (3) (2021)
Hamidreza Validi, Austin Buchanan
The Optimal Design of Low-Latency Virtual Backbones. INFORMS J. Comput. 32 (4) (2020)
Hosseinali Salemi, Austin Buchanan
Parsimonious formulations for low-diameter clusters. Math. Program. Comput. 12 (3) (2020)
Jose L. Walteros, Austin Buchanan
Why Is Maximum Clique Often Easy in Practice? Oper. Res. 68 (6) (2020)
Hamidreza Validi, Austin Buchanan
A note on "A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs". Networks 73 (1) (2019)
Austin Buchanan, Yiming Wang, Sergiy Butenko
Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph. Networks 72 (2) (2018)
Yiming Wang, Austin Buchanan, Sergiy Butenko
On imposing connectivity constraints in integer programs. Math. Program. 166 (1-2) (2017)
Austin Buchanan
Extended formulations for vertex cover. Oper. Res. Lett. 44 (3) (2016)
Sera Kahruman-Anderoglu, Austin Buchanan, Sergiy Butenko, Oleg A. Prokopyev
On provably best construction heuristics for hard combinatorial optimization problems. Networks 67 (3) (2016)
Austin Buchanan, Je Sang Sung, Sergiy Butenko, Eduardo L. Pasiliao
An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets. INFORMS J. Comput. 27 (1) (2015)
Anurag Verma, Austin Buchanan, Sergiy Butenko
Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks. INFORMS J. Comput. 27 (1) (2015)
Austin Buchanan, Jose L. Walteros, Sergiy Butenko, Panos M. Pardalos
algorithm for d-degenerate graphs. Optim. Lett. 8 (5) (2014)
Austin Buchanan, Je Sang Sung, Vladimir Boginski, Sergiy Butenko
On connected dominating sets of restricted diameter. Eur. J. Oper. Res. 236 (2) (2014)