My research focuses on combinatorial optimization problems in graphs or networks. I am particularly interested in:

Here are links to my Google Scholar, GitHub, ORCID, and DBLP


Refereed Journal Articles

  1. Y. Lu, H. Salemi, B. Balasundaram, A. Buchanan. On fault-tolerant low-diameter clusters in graphs. To appear at INFORMS Journal on Computing. (link) (pdf) (code)
  2. H. Validi, A. Buchanan. Political districting to minimize cut edges. To appear at Mathematical Programming Computation. (link) (pdf) (code) (slides) (video)
  3. M.J. Naderi, A. Buchanan, J.L. Walteros. Worst-case analysis of clique MIPs. To appear at Mathematical Programming. (link) (pdf) (code)
  4. H. Salemi, A. Buchanan. Solving the distance-based critical node problem. INFORMS Journal on Computing, 34(3): 1309-1326, 2022. (link) (pdf) (code)
  5. H. Validi, A. Buchanan, E. Lykhovyd. Imposing contiguity constraints in political districting models. Operations Research, 70(2): 867-892, 2022. (link) (pdf) (slides) (code) (video) Winner of the 2021 ICS Harvey J Greenberg Research Award
  6. V. Stozhkov, A. Buchanan, S. Butenko, V. Boginski. Continuous cubic formulations for cluster detection problems in networks. To appear at Mathematical Programming. (link) (pdf)
  7. B. Farmanesh, A. Pourhabib, B. Balasundaram, A. Buchanan. A Bayesian framework for functional calibration of expensive computational models through non-isometric matching. IISE Transactions, 53(3): 352–364, 2021. (link) (pdf
  8. H. Validi, A. Buchanan. The optimal design of low-latency virtual backbones. INFORMS Journal on Computing, 32(4): 952-967, 2020. (link) (pdf) (supplement) (code)
  9. J.L. Walteros, A. Buchanan. Why is maximum clique often easy in practice? Operations Research, 68(6): 1866-1895, 2020. (link) (pdf) (slides) (code Honorable Mention in the 2019 JFIG Paper Competition
  10. H. Salemi, A. Buchanan. Parsimonious formulations for low-diameter clusters. Mathematical Programming Computation, 12(3): 493-528, 2020. (link) (pdf) (slides) (code)
  11. H. Validi, A. Buchanan. A Note on “A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs”. Networks, 73(1): 135-142, 2019. (link) (pdf)
  12. A. Buchanan, Y. Wang, S. Butenko. Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph. Networks, 72(2): 238-248, 2018. (link) (pdf
  13. Y. Wang, A. Buchanan, S. Butenko. On imposing connectivity constraints in integer programs. Mathematical Programming, 166(1): 241-271, 2017. (link) (pdf
  14. A. Buchanan. Extended formulations for vertex cover. Operations Research Letters, 44(3): 374-378, 2016. (link) (pdf) (slides)
  15. S. Kahruman-Anderoglu, A. Buchanan, S. Butenko, O.A. Prokopyev. On provably best construction heuristics for hard combinatorial optimization problems. Networks, 67(3): 238-245, 2016. (link) (pdf)
  16. A. Buchanan, J.S. Sung, S. Butenko, E.L. Pasiliao. An integer programming approach for fault-tolerant connected dominating sets. INFORMS Journal on Computing, 27(1):178-188, 2015(link) (pdf) (testbed)
  17. A. Verma, A. Buchanan, S. Butenko. Solving the maximum clique and vertex coloring problems on very large sparse networks. INFORMS Journal on Computing, 27(1):164-177, 2015. (link) (pdf Selected by INFORMS President L. Robin Keller as the May 2015 President’s Pick article
  18. A. Buchanan, J.S. Sung, V. Boginski, S. Butenko. On connected dominating sets of restricted diameter. European Journal of Operational Research, 236(2):410-418, 2014. (link) (pdf)
  19. A. Buchanan, J.L. Walteros, S. Butenko, P.M. Pardalos. Solving maximum clique in sparse graphs: an O(nm + n2^{d/4}) algorithm for d-degenerate graphs. Optimization Letters, 8(5):1611-1617, 2014. (link) (pdf)

Submitted Papers