Dr. Austin Buchanan
Associate Professor
Areas of Interest
- Combinatorial Optimization
- Integer Programming
- Design and Analysis of Networks
- Operations Research
Academic Qualifications
Ph.D., Industrial and Systems Engineering, Texas A&M University, 2015.
B.S., Industrial Engineering and Management, Oklahoma State University, 2011.
B.S., Industrial Engineering and Management, Oklahoma State University, 2011.
Selected Publications
- H. Validi, A. Buchanan, E. Lykhovyd. Imposing contiguity constraints in political districting models. To appear at Operations Research.
- V. Stozhkov, A. Buchanan, S. Butenko, V. Boginski. Continuous cubic formulations for cluster detection problems in networks. To appear at Mathematical Programming.
- H. Validi, A. Buchanan. The optimal design of low-latency virtual backbones. INFORMS Journal on Computing, 32(4): 952-967, 2020.
- J.L. Walteros, A. Buchanan. Why is maximum clique often easy in practice? Operations Research, 68(6): 1866-1895, 2020.
- H. Salemi, A. Buchanan. Parsimonious formulations for low-diameter clusters. Mathematical Programming Computation, 12(3): 493-528, 2020.
Selected Grants
- A. Buchanan (PI). CAREER: Parsimonious Models for Redistricting. National Science Foundation (CMMI-1942065). $500,000, 06/01/2020--05/31/2025.
- A. Buchanan (PI). Imposing connectivity constraints in large-scale network problems. National Science Foundation (CMMI-1662757). $258,586, 06/15/2017--05/31/2020.