Follow
Austin Buchanan
Austin Buchanan
Associate Professor of Industrial Engineering & Management, Oklahoma State
Verified email at okstate.edu - Homepage
Title
Cited by
Cited by
Year
Solving the maximum clique and vertex coloring problems on very large sparse networks
A Verma, A Buchanan, S Butenko
INFORMS Journal on Computing 27 (1), 164-177, 2015
802015
On imposing connectivity constraints in integer programs
Y Wang, A Buchanan, S Butenko
Mathematical Programming 166 (1), 241-271, 2017
482017
An integer programming approach for fault-tolerant connected dominating sets
A Buchanan, JS Sung, S Butenko, EL Pasiliao
INFORMS Journal on Computing 27 (1), 178-188, 2015
402015
On connected dominating sets of restricted diameter
A Buchanan, JS Sung, V Boginski, S Butenko
European Journal of Operational Research 236 (2), 410-418, 2014
282014
Solving maximum clique in sparse graphs: an O ( n m + n 2 d / 4 ) algorithm for d -degenerate graphs
A Buchanan, JL Walteros, S Butenko, PM Pardalos
Optimization Letters 8 (5), 1611-1617, 2014
252014
Why is maximum clique often easy in practice?
JL Walteros, A Buchanan
Operations Research 68 (6), 1866-1895, 2020
21*2020
Parsimonious formulations for low-diameter clusters
H Salemi, A Buchanan
Mathematical Programming Computation, 2020
20*2020
Imposing contiguity constraints in political districting models
H Validi, A Buchanan, E Lykhovyd
Operations Research, 2021
192021
On provably best construction heuristics for hard combinatorial optimization problems
S Kahruman‐Anderoglu, A Buchanan, S Butenko, OA Prokopyev
Networks 67 (3), 238-245, 2016
142016
Tight extended formulations for independent set
A Buchanan, S Butenko
Available on Optimization Online, 2014
13*2014
Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph
A Buchanan, Y Wang, S Butenko
Networks 72 (2), 238-248, 2018
122018
The optimal design of low-latency virtual backbones
H Validi, A Buchanan
INFORMS Journal on Computing, 2020
6*2020
Continuous cubic formulations for cluster detection problems in networks
V Stozhkov, A Buchanan, S Butenko, V Boginski
Mathematical Programming, 1-29, 2020
52020
A Bayesian framework for functional calibration of expensive computational models through non-isometric matching
B Farmanesh, A Pourhabib, B Balasundaram, A Buchanan
IISE Transactions, 1-30, 2020
52020
Extended formulations for vertex cover
A Buchanan
Operations Research Letters 44 (3), 374-378, 2016
52016
A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs”
H Validi, A Buchanan
Networks 73 (1), 135-142, 2019
42019
Solving the distance-based critical node problem
H Salemi, A Buchanan
INFORMS Journal on Computing, 2021
32021
Parameterized approaches for large-scale optimization problems
AL Buchanan
Texas A&M University, 2015
22015
Worst-case analysis of clique MIPs
MJ Naderi, A Buchanan, JL Walteros
Mathematical Programming, 2021
12021
Solving integer programs with dense conflict graphs
A Buchanan, JL Walteros, S Butenko, PM Pardalos
XII GLOBAL OPTIMIZATION WORKSHOP, 125-128, 2014
12014
The system can't perform the operation now. Try again later.
Articles 1–20