Austin Buchanan

According to our database, Austin Buchanan authored at least 20 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Linear-size formulations for connected planar graph partitioning and political districting.

Jack Zhang, Hamidreza Validi, Austin Buchanan, Illya V. Hicks

Optim. Lett., January, 2024

2022

Political districting to minimize cut edges.

Hamidreza Validi, Austin Buchanan

Math. Program. Comput., 2022

Continuous cubic formulations for cluster detection problems in networks.

Vladimir Stozhkov, Austin Buchanan, Sergiy Butenko, Vladimir Boginski

Math. Program., 2022

Worst-case analysis of clique MIPs.

Mohammad Javad Naderi, Austin Buchanan, Jose L. Walteros

Math. Program., 2022

Imposing Contiguity Constraints in Political Districting Models.

Hamidreza Validi, Austin Buchanan, Eugene Lykhovyd

Oper. Res., 2022

Solving the Distance-Based Critical Node Problem.

Hosseinali Salemi, Austin Buchanan

INFORMS J. Comput., 2022

2021

A Bayesian framework for functional calibration of expensive computational models through non-isometric matching.

Babak Farmanesh, Arash Pourhabib, Balabhaskar Balasundaram, Austin Buchanan

IISE Trans., 2021

2020

Parsimonious formulations for low-diameter clusters.

Hosseinali Salemi, Austin Buchanan

Math. Program. Comput., 2020

Why Is Maximum Clique Often Easy in Practice?

Jose L. Walteros, Austin Buchanan

Oper. Res., 2020

The Optimal Design of Low-Latency Virtual Backbones.

Hamidreza Validi, Austin Buchanan

INFORMS J. Comput., 2020

2019

A note on "A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs".

Hamidreza Validi, Austin Buchanan

Networks, 2019

2018

Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph.

Austin Buchanan, Yiming Wang, Sergiy Butenko

Networks, 2018

2017

On imposing connectivity constraints in integer programs.

Yiming Wang, Austin Buchanan, Sergiy Butenko

Math. Program., 2017

2016

Extended formulations for vertex cover.

Austin Buchanan

Oper. Res. Lett., 2016

On provably best construction heuristics for hard combinatorial optimization problems.

Sera Kahruman-Anderoglu, Austin Buchanan, Sergiy Butenko, Oleg A. Prokopyev

Networks, 2016

2015

Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks.

Anurag Verma, Austin Buchanan, Sergiy Butenko

INFORMS J. Comput., 2015

An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets.

Austin Buchanan, Je Sang Sung, Sergiy Butenko, Eduardo L. Pasiliao

INFORMS J. Comput., 2015

2014

Using GRASP for the Cover by s-Defective Independent Sets Problem.

Austin Buchanan, Nannan Chen, Xin Ma

Proceedings of the Examining Robustness and Vulnerability of Networked Systems, 2014

Solving maximum clique in sparse graphs: an O(nm+n2^d/4 algorithm for d-degenerate graphs.

Austin Buchanan, Jose L. Walteros, Sergiy Butenko, Panos M. Pardalos

Optim. Lett., 2014

On connected dominating sets of restricted diameter.

Austin Buchanan, Je Sang Sung, Vladimir Boginski, Sergiy Butenko

Eur. J. Oper. Res., 2014