# positions[].organizations[].parent[].label
Texas A&M Engineering Experiment Station (TEES)

# overview
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.

# keywords[]
4903 Numerical And Computational Mathematics

# keywords[]
4903 Numerical And Computational Mathematics

# keywords[]
4903 Numerical And Computational Mathematics

# keywords[]
4903 Numerical And Computational Mathematics

# keywords[]
4903 Numerical And Computational Mathematics

# keywords[]
Continuous Approaches To Discrete Optimization

# keywords[]
Analytic Upper Bound On The Clique Number

# keywords[]
Continuous Approaches To Discrete Problems

# keywords[]
4903 Numerical And Computational Mathematics

# keywords[]
4903 Numerical And Computational Mathematics

# keywords[]
4903 Numerical And Computational Mathematics

# educationAndTraining[].organization.label
University of Florida - (Gainesville, Florida, United States)

# educationAndTraining[].organization.label
University of Florida - (Gainesville, Florida, United States)

# educationAndTraining[].organization.label
Taras Shevchenko National University of Kyiv - (Kiev, Ukraine)

# educationAndTraining[].organization.label
Taras Shevchenko National University of Kyiv - (Kiev, Ukraine)

# publications[].label
Algorithms for nodeweighted Steiner tree and maximumweight connected subgraph

# publications[].label
A GRASP for broadcast scheduling in ad-hoc TDMA networks

# publications[].label
Optimal Strategies in Sports Economics and Management

# publications[].label
Constructing test functions for global optimization using continuous formulations of graph problems

# publications[].label
On connected dominating sets of restricted diameter

# publications[].label
Finding independent sets in a graph using continuous multivariable polynomial formulations

# publications[].label
Exact algorithms for the minimum s-club partitioning problem

# publications[].label
Using critical sets to solve the maximum independent set problem

# publications[].label
An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets

# publications[].publisher
Institute for Operations Research and the Management Sciences (INFORMS)

# publications[].label
Asymptotic bounds for clustering problems in random graphs

# publications[].label
Estimating the size of correcting codes using extremal graph problems

# publications[].label
Analytic approaches to college football rankings

# publications[].label
The maximum independent union of cliques problem: complexity and exact approaches

# publications[].label
Robust recursive Bayesian estimation and quantum minimax strategies

# publications[].label
A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere

# publications[].label
Journal of Global Optimization Best Paper Award for a paper published in 2012

# publications[].label
On clique relaxation models in network analysis

# publications[].label
Using critical sets to solve the maximum independent set problem

# publications[].label
Detecting large cohesive subgroups with high clustering coefficients in social networks

# publications[].label
Polyhedral properties of the induced cluster subgraphs

# publications[].label
Risk-based maintenance and rehabilitation decisions for transportation infrastructure networks

# publications[].label
Distance-Based Clique Relaxations in Networks: s-Clique and s-Club

# publications[].label
On the performance of heuristics for broadcast scheduling

# publications[].label
An improved approximation for MAXIMUM k-DEPENDENT SET on bipartite graphs

# publications[].label
Scale Reduction Techniques for Computing Maximum Induced Bicliques

# publications[].label
On biconnected and fragile subgraphs of low diameter

# publications[].label
A network-based data mining approach to portfolio selection via weighted clique relaxations

# publications[].label
A new algorithm for the minimum connected dominant set problem on Ad Hoc wireless networks

# publications[].label
Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks

# publications[].publisher
Institute for Operations Research and the Management Sciences (INFORMS)

# publications[].label
Optimization of multisource information fusion for resource management with remote sensing imagery: An aggregate regularization method with neural network implementation

# publications[].publisher
SPIE, the international society for optics and photonics

# publications[].label
Finding maximum independent sets in graphs arising from coding theory

# publications[].label
The Maximum Edge Weight Clique Problem: Formulations and Solution Approaches

# publications[].label
The maximum number of induced open triangles in graphs of a given order

# publications[].label
A new heuristic for the minimum connected dominating set problem on ad hoc wireless networks

# publications[].label
Checking solvability of systems of interval linear equations and inequalities via mixed integer programming

# publications[].label
Nonlinear dynamical systems and adaptive filters in biomedicine

# publications[].label
Clustering Challenges in Biological Networks

# publications[].label
On greedy construction heuristics for the MAX-CUT problem

# publications[].label
A distributed approximation algorithm for the bottleneck connected dominating set problem

# publications[].label
Soccer Analytics Using Touch-by-Touch Match Data

# publications[].label
Novel approaches for analyzing biological networks

# publications[].label
Solving maximum clique in sparse graphs: an O(nm+n2d/4) algorithm for d-degenerate graphs

# publications[].label
On connected domination in unit ball graphs

# publications[].label
Journal of Global Optimization Best Paper Award for a paper published in 2013

# publications[].label
Statistical analysis of financial networks

# publications[].label
On provably best construction heuristics for hard combinatorial optimization problems

# publications[].label
Approximating 2-cliques in unit disk graphs

# publications[].label
Journal of Global Optimization Best Paper Award for 2015

# publications[].label
On a polynomial fractional formulation for independence number of a graph

# publications[].label
Journal of global optimization: continuing the tradition of excellence

# publications[].label
Clique Relaxation Models in Social Network Analysis

# publications[].label
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem

# publications[].publisher
Institute for Operations Research and the Management Sciences (INFORMS)

# publications[].label
On structural properties of the market graph

# publications[].label
Computational study of the US stock market evolution: a rank correlation-based network model

# publications[].label
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations

# publications[].label
Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs

# publications[].label
Comments on: Optimization and data mining in biomedicine

# publications[].label
Algorithms for the generalized independent set problem based on a quadratic optimization approach

# publications[].label
A HIERARCHY OF STANDARD POLYNOMIAL PROGRAMMING FORMULATIONS FOR THE MAXIMUM CLIQUE PROBLEM

# publications[].publisher
Society for Industrial & Applied Mathematics (SIAM)

# publications[].label
On robust clusters of minimum cardinality in networks

# publications[].label
A global optimization algorithm for solving the minimum multiple ratio spanning tree problem

# publications[].label
On imposing connectivity constraints in integer programs

# publications[].label
On the construction of virtual backbone for ad hoc wireless network

# publications[].label
A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem

# publications[].publisher
Institute for Operations Research and the Management Sciences (INFORMS)

# publications[].label
A nonconvex quadratic optimization approach to the maximum edge weight clique problem

# publications[].label
Clique-detection models in computational biochemistry and genomics

# publications[].label
Detecting robust cliques in graphs subject to uncertain edge failures

# publications[].label
Special Issue: Global Optimization Conference Dedicated in Memory of Christodoulos A. Floudas Preface

# publications[].label
Algorithms for the maximum k-club problem in graphs

# publications[].label
Network clustering via clique relaxations: A community based approach

# publications[].label
Scheduling the adjuvant endocrine therapy for early stage breast cancer

# publications[].label
Journal of Global Optimization Best Paper Award for a paper published in 2014

# publications[].label
2012 Journal of Global Optimization best paper award

# researcherOn[].awardedBy.label
United States Air Force - (Arlington, Virginia, United States)

# researcherOn[].label
Clique Relaxations in Biological and Social Network Analysis: Foundations and Algorithms

# researcherOn[].awardedBy.label
United States Air Force - (Arlington, Virginia, United States)

# researcherOn[].awardedBy.preferredLabel
DOD-Air Force-Office of Scientific Research

# researcherOn[].label
Analysis of Strongly Attack-Tolerant Clusters in Complex Networks

# researcherOn[].awardedBy.label
United States Air Force - (Arlington, Virginia, United States)

# researcherOn[].awardedBy.preferredLabel
DOD-Air Force-Office of Scientific Research

# researcherOn[].label
Continuous Approaches to Optimization Problems in Graphs

# researcherOn[].awardedBy.label
National Science Foundation - (Arlington, Virginia, United States)

# streetAddress
Texas A&M University; Industrial Engineering; 3131 TAMU

# schools[]
Texas A&M Engineering Experiment Station (TEES)

# etdChairOf[].label
Lykhovyd, Eugene (2019-07). THEORY AND ALGORITHMS FOR COMMUNITY DETECTION AND CLUSTERING IN NETWORKS. Doctoral Dissertation.

# etdChairOf[].label
Kahruman-Anderoglu, Sera (2011-02). Optimization in Geometric Graphs: Complexity and Approximation. Doctoral Dissertation.

# etdChairOf[].label
Pattillo, Jeffrey (2012-02). Mathematical Foundations and Algorithms for Clique Relaxations in Networks. Doctoral Dissertation.

# etdChairOf[].label
Sung, Je Sang (2013-12). Generalized Domination in Graphs with Applications in Wireless Networks. Doctoral Dissertation.

# etdChairOf[].label
Trukhanov, Svyatoslav (2009-05). Novel approaches for solving large-scale optimization problems on graphs. Doctoral Dissertation.

# etdChairOf[].label
Sethuraman, Samyukta (2015-10). On Fork-Join Queues and Maximum Ratio Cliques. Doctoral Dissertation.

# etdChairOf[].label
Seyedolshohadaie, Seyed Reza (2012-10). Modeling Risks in Infrastructure Asset Management. Doctoral Dissertation.

# etdChairOf[].label
Balasundaram, Balabhaskar (2009-05). Graph theoretic generalizations of clique: optimization and extensions. Doctoral Dissertation.

# etdChairOf[].label
Wang, Yiming (2015-08). Connectivity Constraints in Network Analysis. Doctoral Dissertation.

# etdChairOf[].label
Shahinpour, Shahram (2013-07). Optimization-Based Network Analysis with Applications in Clustering and Data Mining. Doctoral Dissertation.

# etdChairOf[].label
Ulusal, Elif (2008-10). Integer programming models for the branchwidth problem. Doctoral Dissertation.

# etdChairOf[].label
Balasubramaniam, Chitra (2015-08). Characterizing Structurally Cohesive Clusters in Networks: Theory and Algorithms. Doctoral Dissertation.

# etdChairOf[].label
Kabli, Mohannad Reda A (2014-04). Stochastic Programming Model for Fuel Treatment Management. Master's Thesis.

# etdChairOf[].label
Ursulenko, Oleksii (2011-02). Exact Methods In Fractional Combinatorial Optimization. Doctoral Dissertation.

# etdChairOf[].label
Buchanan, Austin Loyd (2015-07). Parameterized Approaches for Large-Scale Optimization Problems. Doctoral Dissertation.

# etdChairOf[].label
Na, Byungsoo (2007-09). Heurisic approaches for no-depot k-traveling salesmen problem with a minmax objective. Master's Thesis.

# etdChairOf[].label
Verma, Anurag (2012-10). Network Based Approaches for Clustering and Location Decisions. Doctoral Dissertation.

# etdChairOf[].label
Ertem Oktay, Makbule Zeynep (2015-08). Characterizing and Detecting Cohesive Subgroups with Applications to Social and Brain Networks. Doctoral Dissertation.

# etdChairOf[].label
Lee, Seung Ho (2006-08). Greedy randomized adaptive search procedure for traveling salesman problem. Master's Thesis.