Suivre
Austin Buchanan
Austin Buchanan
Associate Professor of Industrial Engineering & Management, Oklahoma State
Adresse e-mail validée de okstate.edu - Page d'accueil
Titre
Citée par
Citée par
Année
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
942015
On imposing connectivity constraints in integer programs
Y Wang, A Buchanan, S Butenko
Mathematical Programming 166, 241-271, 2017
762017
Imposing contiguity constraints in political districting models
H Validi, A Buchanan, E Lykhovyd
Operations Research 70 (2), 867-892, 2022
732022
Why is maximum clique often easy in practice?
JL Walteros, A Buchanan
Operations Research 68 (6), 1866-1895, 2020
532020
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
522015
Solving maximum clique in sparse graphs: an algorithm for -degenerate graphs
A Buchanan, JL Walteros, S Butenko, PM Pardalos
Optimization Letters 8 (5), 1611-1617, 2014
362014
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
352014
Parsimonious formulations for low-diameter clusters
H Salemi, A Buchanan
Mathematical Programming Computation 12, 493-528, 2020
34*2020
Political districting to minimize cut edges
H Validi, A Buchanan
Mathematical Programming Computation 14 (4), 623-672, 2022
332022
Solving the distance-based critical node problem
H Salemi, A Buchanan
INFORMS Journal on Computing 34 (3), 1309-1326, 2022
212022
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
172016
Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph
A Buchanan, Y Wang, S Butenko
Networks 72 (2), 238-248, 2018
142018
The optimal design of low-latency virtual backbones
H Validi, A Buchanan
INFORMS Journal on Computing 32 (4), 855-1186, 2020
132020
Continuous cubic formulations for cluster detection problems in networks
V Stozhkov, A Buchanan, S Butenko, V Boginski
Mathematical Programming 196, 279–307, 2022
122022
Tight extended formulations for independent set
A Buchanan, S Butenko
Available on Optimization Online, 2014
12*2014
Political districting to minimize county splits
M Shahmizad, A Buchanan
Operations Research, 2024
112024
A Bayesian framework for functional calibration of expensive computational models through non-isometric matching
B Farmanesh, A Pourhabib, B Balasundaram, A Buchanan
IISE Transactions 53 (3), 352-364, 2021
102021
Political districting to optimize the Polsby-Popper compactness score with application to voting rights
P Belotti, A Buchanan, S Ezazipour
9*2024
On fault-tolerant low-diameter clusters in graphs
Y Lu, H Salemi, B Balasundaram, A Buchanan
INFORMS Journal on Computing 34 (6), 3181-3199, 2022
72022
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
72019
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20