M. Makovenko, S. Butenko, M. Pardalos. Regularized standard polynomial programming formulations for the maximum clique problem. Computational Optimization and Applications (2025). DOI: 10.1007/s10589-025-00674-z.
H. Zhong , F. Mahdavi Pajouh , S. Butenko , O. A. Prokopyev. On interdicting dense clusters in a network. INFORMS Journal on Computing (2025). DOI: 10.1287/ijoc.2023.0027.
E. Lykhovyd, S. Butenko, P. Krokhmal. Asymptotic bounds for clustering problems in random graphs. Networks, 83: 485–502 (2024). DOI: 10.1002/net.22203.
S. Butenko, M. Makovenko, M. Pardalos. A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem. SIAM Journal on Optimization, 32: 2102–2128 (2022). DOI: 10.1137/21M1419775.
V. Stozhkov, A. Buchanan, S. Butenko, V. Boginski. Continuous cubic formulations for cluster detection problems in networks. Mathematical Programming, 196: 279–307 (2022). DOI: 10.1007/s10107-020-01572-4.
S. Hosseinian, S. Butenko. An improved approximation for Maximum k-dependent Set on bipartite graphs. Discrete Applied Mathematics, 307: 95–101 (2022). DOI: 10.1016/j.dam.2021.10.015.
S. Hosseinian, S. Butenko. Polyhedral properties of the induced cluster subgraphs. Discrete Applied Mathematics, 297: 80–96, 2021. DOI: 10.1016/j.dam.2021.02.040.
S. Hosseinian , D. B. M. M. Fontes, S. Butenko. A Lagrangian bound on the clique number and an exact algorithm for the maximum edge weight clique problem. INFORMS Journal on Computing, 32: 747--762 (2020). DOI: 10.1287/ijoc.2019.0898.
Z. Ertem, E. Lykhovyd, Y. Wang, S. Butenko. The maximum independent union of cliques problem: complexity and exact approaches. Journal of Global Optimization, 76: 545–562 (2020). DOI: 10.1007/s10898-018-0694-2.
O. Yezerska, F. Mahdavi Pajouh, A. Veremyev, S. Butenko. Exact algorithms for the minimum s-club partitioning problem. Annals of Operations Research, 276: 267–291 (2019). DOI: 10.1007/s10479-017-2665-2.
S. Hosseinian, D. B. M. M. Fontes, S. Butenko. A nonconvex quadratic optimization approach to the maximum edge weight clique problem. Journal of Global Optimization, 72: 219–240 (2018). DOI: 10.1007/s10898-018-0630-5.
O. Yezerska, S. Butenko, V. Boginski. Detecting robust cliques in graphs subject to uncertain edge failures. Annals of Operations Research, 262: 109–132 (2018). DOI: 10.1007/s10479-016-2161-0.
Y. Wang, A. Buchanan, S. Butenko. On imposing connectivity constraints in integer programs. Mathematical Programming, 166: 241–271 (2017). DOI: 10.1007/s10107-017-1117-8.
O. Yezerska, F. Mahdavi Pajouh, S. Butenko. On biconnected and fragile subgraphs of low diameter. European Journal of Operational Research, 263: 390–400, 2017. DOI: 10.1016/j.ejor.2017.05.020.
Z. Ertem, A. Veremyev, S. Butenko. Detecting large cohesive subgroups with high clustering coefficients in social networks. Social Networks, 46: 1–10 (2016). DOI: 10.1016/j.socnet.2016.01.001.
A. Veremyev, O. A. Prokopyev, S. Butenko, E. L. Pasiliao. Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs. Computational Optimization and Applications, 64: 177–214 (2016). DOI: 10.1007/s10589-015-9804-y.
S. Kahruman-Anderoglu, A. Buchanan, S. Butenko, O. A. Prokopyev. On provably best construction heuristics for hard combinatorial optimization problems. Networks, 67: 238–245 (2016). DOI: 10.1002/net.21620.
A. Verma, A. Buchanan, S. Butenko.Solving the maximum clique and vertex coloring problems on very large sparse networks. INFORMS Journal on Computing, 27: 164–177 (2015). DOI: 10.1287/ijoc.2014.0618.
A. Buchanan, J. Sung, S. Butenko, E. L. Pasiliao. An integer programming approach for fault-tolerant connected dominating sets. INFORMS Journal on Computing, 27: 178–188 (2015). DOI: 10.1287/ijoc.2014.0619.
S. Sethuraman, S. Butenko. The maximum ratio clique problem. Computational Management Science, 12: 197–218 (2015). DOI: 10.1007/s10287-013-0197-z.
J. Pattillo, Y. Wang, S. Butenko.Approximating 2-cliques in unit disk graphs.Discrete Applied Mathematics,166: 178–187 (2014). DOI: 10.1016/j.dam.2013.10.017.
S. Trukhanov, C. Balasubramaniam, B. Balasundaram, S. Butenko. Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations. Computational Optimization and Applications, 56, 113–130 (2013). DOI: 10.1007/s10589-013-9548-5.
S. Butenko, O. Yezerska, B. Balasundaram. Variable objective search. Journal of Heuristics, 19: 697–709 (2013). DOI: 10.1007/s10732-011-9174-2.
O. Ursulenko, S. Butenko, O. A. Prokopyev. A global optimization algorithm for solving the minimum multiple ratio spanning tree problem. Journal of Global Optimization, 56: 1029–1043 (2013). DOI: 10.1007/s10898-011-9832-9.
J. Pattillo, N. Youssef, S. Butenko. On clique relaxation models in network analysis. European Journal of Operational Research, 226: 9–18 (2013). DOI: 10.1016/j.ejor.2012.10.021.
J. Pattillo, A.Veremyev, S. Butenko, V. Boginski. On the maximum quasi-clique problem. Discrete Applied Mathematics,161; 244–257 (2013). DOI: 10.1016/j.dam.2012.07.019.
B. Balasundaram, S. Butenko, I. V. Hicks. Clique relaxations in social network analysis: the maximum k-Plex problem. Operations Research, 59, 133–142 (2011). DOI: 10.1287/opre.1100.0851.
An Improved Approximation for Maximum k-Dependent Set on Bipartite Graphs. 2021 INFORMS Annual Meeting.
Cluster Detection via Polynomial Optimization. The 7th International Conference on Optimization, Simulation and Control (ICOSC-2022).
Optimization Based Approaches to Network Analytics. 2020 AFOSR Mathematical Optimization Program Review.
Network Analysis Using Clique Relaxations. 3rd Advanced Course on Data Science & Machine Learning (ACDL-2020).
S. Butenko (PI) and P. Krokhmal (co-PI). Nonlinear Approaches to Discrete and Combinatorial Optimization, 07/01/2023--06/30/2026. Air Force Office of Scientific Research, Award FA9550-23-1-0300.
S. Butenko (U.S. PI) and P. Stetsyuk (Ukrainian PI). Risk-Averse Optimization Methods for Facility Location in Renewable Energy Production, 10/01/2021--09/30/2022. CRDF Global, Award G-202102-67302.
P. Krokhmal (PI) and S. Butenko (co-PI). Optimization Based Approaches to Network Analytics, 04/15/2019--04/14/2022. Air Force Office of Scientific Research (via University of Arizona), Award FA9550-19-1-0161.
S. Curtarolo (PI) , M. Buongiorno-Nardelli, M. Fornari, G. Hart, I. Takeuchi, S.Butenko (co-PIs). MURI: Topological Decompositions and Spectral Sampling Algorithms for Element Substitution in Critical Technologies, 11/01/2015--06/30/2018. Office of Naval Research-MURI (via Duke University), Award N000141310635.
S. Butenko (PI). Continuous Approaches to Optimization Problems in Graphs, 08/01/2015--07/31/2018. National Science Foundation, Award CMMI-1538493.
S. Butenko (PI), B. Balasundaram, and V. Boginski (co-PIs). Clique Relaxations in Biological and Social Network Analysis: Foundations and Algorithms, 07/01/2012--06/30/2015, Air Force Office of Scientific Research, Award FA9550-12-1-0103.
S. Butenko (PI). Examining Robustness and Vulnerability of Critical Infrastructure Networks, 09/06/2012--08/31/2014. North Atlantic Treaty Organization, Award ISEG.NUKR.ARW.984503.
B. Balasundaram (PI), V. Boginski, S. Butenko, and S. Uryasev (co-PIs), Robust Optimization for Connectivity and Flows in Dynamic Complex Networks, 9/15/2009--9/14/2012, U.S. Department of Energy, Award DE-SC0002051.
S. Butenko (PI). Collaborative Research: International Experience for Students: U.S.-Ukraine Collaboration on Discrete and Nondifferentiable Optimization, 06/01/2009--5/31/2012, National Science Foundation, Award OISE-0853804.
S. Butenko (PI). Optimization Techniques for Analysis of Biological and Social Networks, 03/01/2009--11/30/2011, Air Force Office of Scientific Research, Young Investigator Program, Award FA9550-09-1-0154.