HR job title
- Professor
- Contact Info
- 1 979 458 2333
- Websites
Butenko, Sergiy Professor
Positions
- Professor, Industrial and Systems Engineering, College of Engineering
- Faculty Affiliate, Energy Institute, Texas A&M Engineering Experiment Station (TEES)
Dr. Butenko's research concentrates mainly on global and discrete optimization and their applications. In particular, he is interested in theoretical and computational aspects of continuous global optimization approaches for solving discrete optimization problems on graphs. Applications of interest include network-based data mining, analysis of biological and social networks, wireless ad hoc and sensor networks, energy, and sports analytics.
- Overview
- Publications
- Research
- Teaching
- Works By Students
- Background
- Contact
- Other
- View All
Overview
Publications
selected publications
-
academic article
-
Lykhovyd, E., Butenko, S., & Krokhmal, P.
(2023).
Asymptotic bounds for clustering problems in random graphs. Networks.
-
Blokhin, Y., Butenko, S., Momcilovic, P., & Prokopyev, O. A.
(2022).
On maximum ratio clique relaxations. Networks.
80(4), 440-465.
-
Butenko, S., Makovenko, M., & Pardalos, M.
(2022).
A HIERARCHY OF STANDARD POLYNOMIAL PROGRAMMING FORMULATIONS FOR THE MAXIMUM CLIQUE PROBLEM. SIAM Journal on Optimization.
32(3), 2102-2128.
-
Hosseinian, S., & Butenko, S.
(2022).
An improved approximation for MAXIMUM k-DEPENDENT SET on bipartite graphs. DISCRETE APPLIED MATHEMATICS.
307, 95-101.
-
Hosseinian, S., & Butenko, S.
(2021).
Polyhedral properties of the induced cluster subgraphs. DISCRETE APPLIED MATHEMATICS.
297, 80-96.
-
Ertem, Z., Lykhovyd, E., Wang, Y., & Butenko, S.
(2020).
The maximum independent union of cliques problem: complexity and exact approaches. Journal of Global Optimization.
76(3), 545-562.
-
Hosseinian, S., Fontes, D., & Butenko, S.
(2020).
A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem. INFORMS Journal on Computing.
32(3), 747-762.
-
Pyatkin, A., Lykhovyd, E., & Butenko, S.
(2019).
The maximum number of induced open triangles in graphs of a given order. Optimization Letters.
13(8), 1927-1935.
-
Hosseinian, S., & Butenko, S.
(2019).
Algorithms for the generalized independent set problem based on a quadratic optimization approach. Optimization Letters.
13(6), 1211-1222.
-
Butenko, S., & Pistikopoulos, E. N.
(2019).
Special Issue: Global Optimization Conference Dedicated in Memory of Christodoulos A. Floudas Preface. Journal of Global Optimization.
74(4), 597-598.
-
Yezerska, O., Mahdavi Pajouh, F., Veremyev, A., & Butenko, S.
(2019).
Exact algorithms for the minimum s-club partitioning problem. Annals of Operations Research.
276(1-2), 267-291.
-
Davydov, A. V., & Kattner, U. R.
(2019).
Predicting synthesizability. Journal of Physics D: Applied Physics.
52(1), 013001-013001.
-
Hosseinian, S., Fontes, D., & Butenko, S.
(2018).
A nonconvex quadratic optimization approach to the maximum edge weight clique problem. 72(2), 219-240.
-
Buchanan, A., Wang, Y., & Butenko, S.
(2018).
Algorithms for nodeweighted Steiner tree and maximumweight connected subgraph. Networks.
72(2), 238-248.
-
Yezerska, O., Butenko, S., & Boginski, V. L.
(2018).
Detecting robust cliques in graphs subject to uncertain edge failures. Annals of Operations Research.
262(1), 109-132.
-
Shahinpour, S., Shirvani, S., Ertem, Z., & Butenko, S.
(2017).
Scale Reduction Techniques for Computing Maximum Induced Bicliques. Algorithms.
10(4), 113-113.
-
Wang, Y., Buchanan, A., & Butenko, S.
(2017).
On imposing connectivity constraints in integer programs. Mathematical programming.
166(1-2), 241-271.
-
Balasubramaniam, C., & Butenko, S.
(2017).
On robust clusters of minimum cardinality in networks. Annals of Operations Research.
249(1-2), 17-37.
-
Yezerska, O., Pajouh, F. M., & Butenko, S.
(2017).
On biconnected and fragile subgraphs of low diameter. European Journal of Operational Research.
263(2), 390-400.
-
Butenko, S.
(2016).
Journal of Global Optimization Best Paper Award for 2015. Journal of Global Optimization.
66(4), 595-596.
-
Veremyev, A., Prokopyev, O. A., Butenko, S., & Pasiliao, E. L.
(2016).
Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs. Computational Optimization and Applications.
64(1), 177-214.
-
KahrumanAnderoglu, S., Buchanan, A., Butenko, S., & Prokopyev, O. A.
(2016).
On provably best construction heuristics for hard combinatorial optimization problems. Networks.
67(3), 238-245.
-
Ertem, Z., Veremyev, A., & Butenko, S.
(2016).
Detecting large cohesive subgroups with high clustering coefficients in social networks. Social Networks.
46, 1-10.
-
Butenko, S.
(2015).
Journal of Global Optimization Best Paper Award for a paper published in 2014. Journal of Global Optimization.
63(4), 631-632.
-
Buchanan, A., Sung, J. S., Butenko, S., & Pasiliao, E. L.
(2015).
An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets. 27(1), 178-188.
-
Verma, A., Buchanan, A., & Butenko, S.
(2015).
Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks. INFORMS Journal on Computing.
27(1), 164-177.
-
Sethuraman, S., & Butenko, S.
(2015).
The maximum ratio clique problem. Computational Management Science.
12(1), 197-218.
-
Butenko, S.
(2014).
Journal of Global Optimization Best Paper Award for a paper published in 2013. Journal of Global Optimization.
60(4), 597-598.
-
Butenko, S., Du, D., & Resende, M.
(2014).
Preface. Journal of Combinatorial Optimization.
28(1), 1-2.
-
Buchanan, A., Walteros, J. L., Butenko, S., & Pardalos, P. M.
(2014).
Solving maximum clique in sparse graphs: an O(nm+n2d/4) algorithm for d-degenerate graphs. Optimization Letters.
8(5), 1611-1617.
-
Boginski, V., Butenko, S., Shirokikh, O., Trukhanov, S., & Gil Lafuente, J.
(2014).
A network-based data mining approach to portfolio selection via weighted clique relaxations. Annals of Operations Research.
216(1), 23-34.
-
Pattillo, J., Wang, Y., & Butenko, S.
(2014).
Approximating 2-cliques in unit disk graphs. DISCRETE APPLIED MATHEMATICS.
166, 178-187.
-
Butenko, S.
(2014).
Journal of Global Optimization Best Paper Award for a paper published in 2012. Journal of Global Optimization.
58(2), 205-205.
-
Buchanan, A., Sung, J. S., Boginski, V., & Butenko, S.
(2014).
On connected dominating sets of restricted diameter. European Journal of Operational Research.
236(2), 410-418.
-
Shahinpour, S., & Butenko, S.
(2013).
Algorithms for the maximum k-club problem in graphs. Journal of Combinatorial Optimization.
26(3), 520-554.
-
Trukhanov, S., Balasubramaniam, C., Balasundaram, B., & Butenko, S.
(2013).
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations. Computational Optimization and Applications.
56(1), 113-130.
-
Butenko, S., Yezerska, O., & Balasundaram, B.
(2013).
Variable objective search. Journal of Heuristics.
19(4), 697-709.
-
Shirokikh, O., Pastukhov, G., Boginski, V., & Butenko, S.
(2013).
Computational study of the US stock market evolution: a rank correlation-based network model. Computational Management Science.
10(2-3), 81-103.
-
Butenko, S.
(2013).
2012 Journal of Global Optimization best paper award. Journal of Global Optimization.
55(3), 489-490.
-
Pattillo, J., Youssef, N., & Butenko, S.
(2013).
On clique relaxation models in network analysis. European Journal of Operational Research.
226(1), 9-18.
-
Pattillo, J., Veremyey, A., Butenko, S., & Boginski, V.
(2013).
On the maximum quasi-clique problem. DISCRETE APPLIED MATHEMATICS.
161(1-2), 244-257.
-
Butenko, S.
(2013).
Journal of global optimization: continuing the tradition of excellence. Journal of Global Optimization.
55(1), 1-2.
-
Verma, A., & Butenko, S.
(2012).
A distributed approximation algorithm for the bottleneck connected dominating set problem. Optimization Letters.
6(8), 1583-1595.
-
Kahruman, S., Ulusal, E., Butenko, S., Hicks, I. V., & Diehl, K. M.
(2012).
Scheduling the adjuvant endocrine therapy for early stage breast cancer. Annals of Operations Research.
196(1), 683-705.
-
Butenko, S., Kahruman-Anderoglu, S., & Ursulenko, O.
(2011).
On connected domination in unit ball graphs. Optimization Letters.
5(2), 195-205.
-
Balasundaram, B., Butenko, S., & Hicks, I. V.
(2011).
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem. Operations Research.
59(1), 133-142.
-
Seyedshohadaie, S. R., Damnjanovic, I., & Butenko, S.
(2010).
Risk-based maintenance and rehabilitation decisions for transportation infrastructure networks. Transportation Research Part A: Policy and Practice.
44(4), 236-248.
-
Prokopyev, O. A., Butenko, S., & Trapp, A.
(2009).
Checking solvability of systems of interval linear equations and inequalities via mixed integer programming. European Journal of Operational Research.
199(1), 117-121.
-
Butenko, S.
(2009).
Comments on: Optimization and data mining in biomedicine. TOP: An Official Journal of the Spanish Society of Statistics and Operations Research.
17(2), 239-239.
-
Butenko, S., & Trukhanov, S.
(2007).
Using critical sets to solve the maximum independent set problem. Operations Research Letters.
35(4), 519-524.
-
Kahruman, S., Kolotoglu, E., Butenko, S., & Hicks, I. V.
(2007).
On greedy construction heuristics for the MAX-CUT problem. International Journal of Computational Science and Engineering.
3(3), 211-218.
-
Butenko, S., & Trukhanov, S.
(2007).
Using critical sets to solve the maximum independent set problem. Operations Research Letters.
35(4), 519-524.
-
Boginski, V., Butenko, S., & Pardalos, P. M.
(2006).
Mining market data: A network approach. Computers & Operations Research.
33(11), 3171-3184.
-
Butenko, S., & Wilhelm, W. E.
(2006).
Clique-detection models in computational biochemistry and genomics. European Journal of Operational Research.
173(1), 1-17.
-
Boginski, V., Butenko, S., & Pardalos, P. M.
(2006).
Mining market data: A network approach. Computers & Operations Research.
33(11), 3171-3184.
-
Balasundaram, B., & Butenko, S.
(2006).
On a polynomial fractional formulation for independence number of a graph. Journal of Global Optimization.
35(3), 405-421.
-
Butenko, S., Golodnikov, A., & Uryasev, S.
(2005).
Optimal security liquidation algorithms. Computational Optimization and Applications.
32(1-2), 9-27.
-
Boginski, V., Butenko, S., & Pardalos, P. M.
(2005).
Statistical analysis of financial networks. Computational Statistics and Data Analysis.
48(2), 431-443.
-
Pardalos, P. M., Sackellares, J. C., Yatsenko, V. A., & Butenko, S. I.
(2003).
Nonlinear dynamical systems and adaptive filters in biomedicine. Annals of Operations Research.
119(1-4), 119-142.
-
Abello, J., Butenko, S., Pardalos, P. M., & Resende, M.
(2001).
Finding independent sets in a graph using continuous multivariable polynomial formulations. Journal of Global Optimization.
21(2), 111-137.
-
Butenko, S., Festa, P., & Pardalos, P. M.
(2001).
On the chromatic number of graphs. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS.
109(1), 51-67.
-
Lykhovyd, E., Butenko, S., & Krokhmal, P.
(2023).
Asymptotic bounds for clustering problems in random graphs. Networks.
-
book
-
Tang, S., Du, D. Z., Woodruff, D., & Butenko, S.
(2018).
Preface. Ed. 11343 LNCS.
-
Rassias, T. M., Butenko, S., & Floudas, C. A.
(2014).
Optimization in Science and Engineering. Ed. 9781493908080.
Springer New York.
-
Pardalos, P. M., Gil-Lafuente, J., & Butenko, S.
(2010).
Optimal Strategies in Sports Economics and Management. Springer Berlin Heidelberg.
-
Butenko, S., Chaovalitwongse, W. A., & Pardalos, P. M.
(2009).
Clustering Challenges in Biological Networks. WORLD SCIENTIFIC.
-
Butenko, S., Chaovalitwongse, W. A., & Pardalos, P. M.
(2009).
FRONT MATTER. WORLD SCIENTIFIC.
-
Tang, S., Du, D. Z., Woodruff, D., & Butenko, S.
(2018).
Preface. Ed. 11343 LNCS.
-
chapter
-
Yezerska, O., & Butenko, S.
(2018).
The Maximum Clique and Vertex Coloring. Handbook of Heuristics.
(pp. 1259-1289).
Springer Nature.
-
Hosseinian, S., Fontes, D., Butenko, S., Nardelli, M. B., Fornari, M., & Curtarolo, S.
(2017).
The Maximum Edge Weight Clique Problem: Formulations and Solution Approaches. Springer Optimization and Its Applications.
Optimization Methods and Applications.
(pp. 217-237).
Springer Nature.
-
Butenko, S., & Yates, J.
(2014).
Soccer Analytics Using Touch-by-Touch Match Data. Social Networks and the Economics of Sports.
(pp. 149-156).
Springer Nature.
-
Pattillo, J., Youssef, N., & Butenko, S.
(2012).
Clique Relaxation Models in Social Network Analysis. Springer Optimization and Its Applications.
Handbook of Optimization in Complex Networks.
(pp. 143-162).
Springer Nature.
-
Butenko, S., Pardalos, P., Sergienko, I., Shylo, V., & Stetsyuk, P.
(2009).
Estimating the size of correcting codes using extremal graph problems. Springer Optimization and Its Applications.
Optimization.
(pp. 227-243).
Springer Nature.
-
Balasundaram, B., & Butenko, S.
(2008).
Network Clustering. Analysis of Biological Networks.
(pp. 113-138).
Wiley.
-
Yezerska, O., & Butenko, S.
(2018).
The Maximum Clique and Vertex Coloring. Handbook of Heuristics.
(pp. 1259-1289).
Springer Nature.
-
conference paper
-
Shirokikh, O., Pastukhov, G., Semenov, A., Butenko, S., Veremyev, A., Pasiliao, E., & Boginski, V.
(2018).
Computational Data and Social Networks. Lecture Notes in Computer Science.
541-542.
-
Butenko, S., Chaovalitwongse, W. A., & Pardalos, P. M.
(2013).
Preface
-
Ursulenko, O., Butenko, S., & Prokopyev, O. A.
(2013).
A global optimization algorithm for solving the minimum multiple ratio spanning tree problem. Journal of Global Optimization.
1029-1043.
-
Shahinpour, S., & Butenko, S.
(2013).
Distance-Based Clique Relaxations in Networks: s-Clique and s-Club. Springer Proceedings in Mathematics and Statistics.
149-174.
-
Verma, A., & Butenko, S.
(2013).
Network clustering via clique relaxations: A community based approach. Contemporary Mathematics.
129-139.
-
Shkvarko, Y., & Butenko, S.
(2006).
Optimization of multisource information fusion for resource management with remote sensing imagery: An aggregate regularization method with neural network implementation. Proceedings of SPIE.
62350z-62350z-10.
-
Butenko, S., Pardalos, P., & Boginski, V.
(2005).
Analytic approaches to college football rankings. Research Quarterly for Exercise and Sport.
A13-A13.
-
Balasundaram, B., & Butenko, S.
(2005).
Constructing test functions for global optimization using continuous formulations of graph problems. Optimization Methods and Software.
439-452.
-
Balasundaram, B., Butenko, S., & Trukhanov, S.
(2005).
Novel approaches for analyzing biological networks. Journal of Combinatorial Optimization.
23-39.
-
Butenko, S. I., Commander, C. W., & Pardalos, P. M.
(2004).
A GRASP for broadcast scheduling in ad-hoc TDMA networks. 323-327.
-
Butenko, S., Cheng, X. Z., Oliveira, C. A., & Pardalos, P. M.
(2004).
A new heuristic for the minimum connected dominating set problem on ad hoc wireless networks. 61-73.
-
Commander, C. W., Butenko, S. I., & Pardalos, P. M.
(2004).
On the performance of heuristics for broadcast scheduling. THEORY AND ALGORITHMS FOR COOPERATIVE SYSTEMS.
63-80.
-
Boginski, V., Butenko, S., & Pardalos, P. M.
(2003).
On structural properties of the market graph. 29-45.
-
Butenko, S., Cheng, X. Z., Du, D. Z., & Pardalos, P. M.
(2003).
On the construction of virtual backbone for ad hoc wireless network. 43-54.
-
Butenko, S., Oliveira, C., & Pardalos, P. M.
(2003).
A new algorithm for the minimum connected dominant set problem on Ad Hoc wireless networks. 39-44.
-
Busygin, S., Butenko, S., & Pardalos, P. M.
(2002).
A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere. Journal of Combinatorial Optimization.
287-297.
-
Pardalos, P., Yatsenko, V., & Butenko, S.
(2002).
Robust recursive Bayesian estimation and quantum minimax strategies. Applied Optimization.
213-232.
-
Butenko, S., Pardalos, P., Sergienko, I., & Shylo, V.
(2002).
Finding maximum independent sets in graphs arising from coding theory. 542-546.
-
Shirokikh, O., Pastukhov, G., Semenov, A., Butenko, S., Veremyev, A., Pasiliao, E., & Boginski, V.
(2018).
Computational Data and Social Networks. Lecture Notes in Computer Science.
541-542.
Research
principal investigator on
- Continuous Approaches to Optimization Problems in Graphs awarded by National Science Foundation - (Arlington, Virginia, United States) 2015 - 2018
- Analysis of Strongly Attack-Tolerant Clusters in Complex Networks awarded by United States Air Force - (Arlington, Virginia, United States) 2012 - 2016
- Virtual Backbones in Networked Systems awarded by United States Air Force - (Arlington, Virginia, United States) 2014 - 2015
- Clique Relaxations in Biological and Social Network Analysis: Foundations and Algorithms awarded by United States Air Force - (Arlington, Virginia, United States) 2012 - 2015
Teaching
teaching activities
- ENGR689 Sptp: Network-based Data Analy Instructor
- ICPE606 Introduction To Optimization Instructor
- ISEN302 Econ Anly Engr Project-greece Instructor
- ISEN302 Econ Anly Engr Project-spain Instructor
- ISEN302 Econ Anly Engr Project: Esp Instructor
- ISEN320 Operations Research I Instructor
- ISEN485 Directed Studies Instructor
- ISEN489 Sptp: Numerical Method In Isen Instructor
- ISEN491 Hnr-research Instructor
- ISEN491 Hnr-research Instructor
- ISEN620 Survey Optimization Instructor
- ISEN621 Heuristic Optimization Instructor
- ISEN622 Linear Programming Instructor
- ISEN623 Non-linear & Dyn Prog Instructor
- ISEN629 Engr Optimization Instructor
- ISEN661 Ntwk-bas Plan &sch Sys Instructor
- ISEN668 Integer Programming Instructor
- ISEN684 Professional Internship: In-ab Instructor
- ISEN684 Professional Internship: In-ab Instructor
- ISEN685 Directed Studies Instructor
- ISEN691 Research Instructor
- ISEN692 Professional Study Instructor
- ITDE691 Research Instructor
Works By Students
chaired theses and dissertations
-
Balasubramaniam, Chitra (2015-08). Characterizing Structurally Cohesive Clusters in Networks: Theory and Algorithms.
-
Balasundaram, Balabhaskar (2009-05). Graph theoretic generalizations of clique: optimization and extensions.
-
Buchanan, Austin Loyd (2015-07). Parameterized Approaches for Large-Scale Optimization Problems.
-
Ertem Oktay, Makbule Zeynep (2015-08). Characterizing and Detecting Cohesive Subgroups with Applications to Social and Brain Networks.
-
Kabli, Mohannad Reda A (2014-04). Stochastic Programming Model for Fuel Treatment Management.
-
Kahruman-Anderoglu, Sera (2011-02). Optimization in Geometric Graphs: Complexity and Approximation.
-
Lee, Seung Ho (2006-08). Greedy randomized adaptive search procedure for traveling salesman problem.
-
Lykhovyd, Eugene (2019-07). THEORY AND ALGORITHMS FOR COMMUNITY DETECTION AND CLUSTERING IN NETWORKS.
-
Na, Byungsoo (2007-09). Heurisic approaches for no-depot k-traveling salesmen problem with a minmax objective.
-
Pattillo, Jeffrey (2012-02). Mathematical Foundations and Algorithms for Clique Relaxations in Networks.
-
Sethuraman, Samyukta (2015-10). On Fork-Join Queues and Maximum Ratio Cliques.
-
Seyedolshohadaie, Seyed Reza (2012-10). Modeling Risks in Infrastructure Asset Management.
-
Shahinpour, Shahram (2013-07). Optimization-Based Network Analysis with Applications in Clustering and Data Mining.
-
Sung, Je Sang (2013-12). Generalized Domination in Graphs with Applications in Wireless Networks.
-
Trukhanov, Svyatoslav (2009-05). Novel approaches for solving large-scale optimization problems on graphs.
-
Ulusal, Elif (2008-10). Integer programming models for the branchwidth problem.
-
Ursulenko, Oleksii (2011-02). Exact Methods In Fractional Combinatorial Optimization.
-
Verma, Anurag (2012-10). Network Based Approaches for Clustering and Location Decisions.
-
Wang, Yiming (2015-08). Connectivity Constraints in Network Analysis.
Background
education and training
- Ph.D. in Industrial and Systems Engineering, University of Florida - (Gainesville, Florida, United States) 2003
- M.S. in Industrial and Systems Engineering, University of Florida - (Gainesville, Florida, United States) 2001
- M.S. in Mathematics (Honors), Taras Shevchenko National University of Kyiv - (Kiev, Ukraine) 1999
- B.S. in Mathematics (Honors), Taras Shevchenko National University of Kyiv - (Kiev, Ukraine) 1998
Contact
first name
- Sergiy
has last name
- Butenko
mailing address
-
Texas A&M University
Industrial Engineering
3131 TAMU
College Station, TX 77843-3131
USA
Other
- butenko@tamu.edu