- About IE&M
- Prospective Students
- Student Organizations
- Course Catalog
- Class Schedule
- Undergraduate Degree Plan
Areas of Interest
- Combinatorial Optimization
- Integer Programming
- Design and Analysis of Networks
- Operations Research
Ph.D., Industrial and Systems Engineering, Texas A&M University, 2015.
B.S., Industrial Engineering and Management, Oklahoma State University, 2011.
- H. Salemi, A. Buchanan. Parsimonious formulations for low-diameter clusters. To appear, Mathematical Programming Computation.
- J.L. Walteros, A. Buchanan. Why is maximum clique often easy in practice? To appear, Operations Research.
- H. Validi, A. Buchanan. The optimal design of low-latency virtual backbones. To appear, INFORMS Journal on Computing.
- A. Buchanan, Y. Wang, S. Butenko. Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph. Networks, 72(2): 238-248, 2018.
- Y. Wang, A. Buchanan, S. Butenko. On imposing connectivity constraints in integer programs. Mathematical Programming, 166(1): 241-271, 2017.
- 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.