S. Butenko

发表

Clustering challenges in biological networks

P. Pardalos, S. Butenko, W. Chaovalitwongse, 2009 .

Numerical Methods and Optimization: An Introduction

P. Pardalos, S. Butenko, 2014 .

Statistical analysis of financial networks

Panos M. Pardalos, Sergiy Butenko, Vladimir Boginski, 2005, Comput. Stat. Data Anal..

Asset Management Literature Review and Potential Applications of Simulation, Optimization, and Decision Analysis Techniques for Right-of-Way and Transportation Planning and Programming

Sergiy Butenko, Illya V. Hicks, Seth D Guikema, 2007 .

Continuous cubic formulations for cluster detection problems in networks

S. Butenko, Austin Buchanan, V. Boginski, 2020, Mathematical Programming.

Clique , independent set , and graph coloring

S. Butenko, Jeffrey Pattillo, 2010 .

Clique Relaxations in Biological and Social Network Analysis Foundations and Algorithms

S. Butenko, V. Boginski, Balabhaskar Balasundaram, 2015 .

Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations

Sergiy Butenko, Balabhaskar Balasundaram, Svyatoslav Trukhanov, 2013, Computational Optimization and Applications.

Robust Recursive Bayesian Estimation and Quantum Minimax Strategies

Panos M. Pardalos, Sergiy Butenko, Vitaliy A. Yatsenko, 2002 .

Maximum independent set and related problems, with applications

Sergiy Butenko, S. Butenko, P. M. Pardalos, 2003 .

Contribution for Innovations in Financial and Economic Networks

P. Pardalos, S. Butenko, V. Boginski, 2003 .

On the Chromatic Number of Graphs

Panos M. Pardalos, Sergiy Butenko, Paola Festa, 2001 .

Tight extended formulations for independent set ∗

S. Butenko, Austin Buchanan, 2015 .

ON DEPENDENT DATA FETCHING IN CLOUD ENVIRONMENT A Thesis by JIACHENG GU Submitted to the Office of Graduate and Professional Studies of Texas A&M University in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE

Jianer Chen, S. Butenko, D. D. Silva, 2015 .

ONTHE PERFORMANCE OFHEURISTICS FOR BROADCAST SCHEDULING

S. Butenko, C. Commander, 2004 .

The 2019 materials by design roadmap

Aron Walsh, Alán Aspuru-Guzik, Lubos Mitas, 2018, Journal of physics D: Applied physics.

Networks of causal relationships in the U.S. stock market

E. Pasiliao, S. Butenko, Alexander Semenov, 2022, Dependence Modeling.

Networks of materials: Construction and structural analysis

Marco Buongiorno Nardelli, Sergiy Butenko, Alexander Veremyev, 2020, AIChE Journal.

Networks of materials: Construction and structural analysis

S. Butenko, M. Buongiorno Nardelli, S. Curtarolo, 2020, AIChE Journal.

Solution Strategies for Integrated Distribution, Production, and Routing Problems Arising in Modular Manufacturing

R. C. Allen, S. Butenko, Styliani Avraamidou, 2022 .

On maximum ratio clique relaxations

S. Butenko, P. Momčilović, O. Prokopyev, 2022, Networks.

On imposing connectivity constraints in integer programs

S. Butenko, Austin Buchanan, Yiming Wang, 2017, Mathematical Programming.

Exact algorithms for the minimum s-club partitioning problem

S. Butenko, Alexander Veremyev, Oleksandra Yezerska, 2017, Annals of Operations Research.

Detecting robust cliques in graphs subject to uncertain edge failures

S. Butenko, V. Boginski, Oleksandra Yezerska, 2016, Annals of Operations Research.

Computational study of the US stock market evolution: a rank correlation-based network model

S. Butenko, V. Boginski, Oleg Shirokikh, 2013, Computational Management Science.

Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations

S. Butenko, Balabhaskar Balasundaram, S. Trukhanov, 2013, Computational Optimization and Applications.

A nonconvex quadratic optimization approach to the maximum edge weight clique problem

S. Butenko, D. Fontes, Seyedmohammadhossein Hosseinian, 2018, Journal of Global Optimization.

The maximum ratio clique problem

S. Butenko, Samyukta Sethuraman, 2013, Computational Management Science.

Scheduling the adjuvant endocrine therapy for early stage breast cancer

Sergiy Butenko, Illya V. Hicks, Elif Ulusal, 2012, Ann. Oper. Res..

Journal of Global Optimization Best Paper Award for a paper published in 2012

Sergiy Butenko, S. Butenko, 2014, J. Glob. Optim..

The Maximum Clique and Vertex Coloring

Sergiy Butenko, Oleksandra Yezerska, S. Butenko, 2018, Handbook of Heuristics.

Optimization Methods and Applications

Panos M. Pardalos, Sergiy Butenko, Volodymyr Shylo, 2017 .

2012 Journal of Global Optimization best paper award

Sergiy Butenko, S. Butenko, 2013, Journal of Global Optimization.

Mathematical foundations and algorithms for clique relaxations in networks

Sergiy Butenko, Jeffrey Pattillo, S. Butenko, 2011 .

Approximating 2-cliques in unit disk graphs

Yiming Wang, Sergiy Butenko, Jeffrey Pattillo, 2014, Discrete Applied Mathematics.

Chapter 13: Deterministic Global Optimization

Panos M. Pardalos, Sergiy Butenko, P. Pardalos, 2017 .

A network-based data mining approach to portfolio selection via weighted clique relaxations

S. Butenko, V. Boginski, Oleg Shirokikh, 2013, Annals of Operations Research.

Optimization in Science and Engineering

Christodoulos A. Floudas, Sergiy Butenko, Themistocles M. Rassias, 2014 .

Network-based optimization techniques for wind farm location decisions

Seyedmohammadhossein Hosseinian, Sergiy Butenko, Jorge Ignacio Cisneros-Saldana, 2018 .

A distributed approximation algorithm for the bottleneck connected dominating set problem

Anurag Verma, Sergiy Butenko, S. Butenko, 2012, Optim. Lett..

Network Clustering

Sergiy Butenko, Balabhaskar Balasundaram, S. Butenko, 2014, Encyclopedia of Social Network Analysis and Mining.

On connected domination in unit ball graphs

Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii Ursulenko, 2011, Optim. Lett..

Exact algorithms for the minimum s-club partitioning problem

Sergiy Butenko, Alexander Veremyev, Foad Mahdavi Pajouh, 2017, Annals of Operations Research.

Detecting robust cliques in graphs subject to uncertain edge failures

Sergiy Butenko, Vladimir Boginski, Oleksandra Yezerska, 2018, Ann. Oper. Res..

Detecting large cohesive subgroups with high clustering coefficients in social networks

Sergiy Butenko, Alexander Veremyev, Zeynep Ertem, 2016, Soc. Networks.

An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets

Eduardo L. Pasiliao, Sergiy Butenko, Austin Buchanan, 2015, INFORMS J. Comput..

On connected dominating sets of restricted diameter

Sergiy Butenko, Vladimir Boginski, Austin Buchanan, 2014, Eur. J. Oper. Res..

A New Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks

Panos M. Pardalos, Xiuzhen Cheng, Carlos A. S. Oliveira, 2004 .

On clique relaxation models in network analysis

Sergiy Butenko, Jeffrey Pattillo, Nataly Youssef, 2013, Eur. J. Oper. Res..

Maximum Clique, Maximum Independent Set, and Graph Coloring Problems

S. Butenko, Jeffrey Pattillo, 2011 .

Constructing test functions for global optimization using continuous formulations of graph problems

Sergiy Butenko, Balabhaskar Balasundaram, S. Butenko, 2005, Optim. Methods Softw..

Finding independent sets in a graph using continuous multivariable polynomial formulations

Panos M. Pardalos, Mauricio G. C. Resende, James Abello, 2001, J. Glob. Optim..

Matrix-based Methods for College Football Rankings

Panos M. Pardalos, Sergiy Butenko, Vladimir Boginski, 2004 .

Mining market data: A network approach

Panos M. Pardalos, Sergiy Butenko, Vladimir Boginski, 2006, Comput. Oper. Res..

Clique-detection models in computational biochemistry and genomics

Wilbert E. Wilhelm, Sergiy Butenko, W. Wilhelm, 2006, Eur. J. Oper. Res..

On the maximum quasi-clique problem

Sergiy Butenko, Alexander Veremyev, Vladimir Boginski, 2013, Discret. Appl. Math..

Nonlinear Dynamical Systems and Adaptive Filters in Biomedicine

Panos M. Pardalos, Sergiy Butenko, Vitaliy A. Yatsenko, 2003, Ann. Oper. Res..

A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem

Seyedmohammadhossein Hosseinian, Sergiy Butenko, Dalila B. M. M. Fontes, 2020, INFORMS J. Comput..

A nonconvex quadratic optimization approach to the maximum edge weight clique problem

Seyedmohammadhossein Hosseinian, Sergiy Butenko, Dalila B. M. M. Fontes, 2018, J. Glob. Optim..

Optimization Problems in Unit-Disk Graphs

Sergiy Butenko, Balabhaskar Balasundaram, S. Butenko, 2009, Encyclopedia of Optimization.

Novel Approaches for Analyzing Biological Networks

Sergiy Butenko, Balabhaskar Balasundaram, Svyatoslav Trukhanov, 2005, J. Comb. Optim..

On greedy construction heuristics for the MAX-CUT problem

Sergiy Butenko, Illya V. Hicks, Sera Kahruman-Anderoglu, 2007, Int. J. Comput. Sci. Eng..

Distance-Based Clique Relaxations in Networks: s-Clique and s-Club

Shahram Shahinpour, Sergiy Butenko, S. Butenko, 2013 .

Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks

Anurag Verma, Sergiy Butenko, Austin Buchanan, 2015, INFORMS J. Comput..

The Maximum Edge Weight Clique Problem: Formulations and Solution Approaches

Marco Buongiorno Nardelli, Stefano Curtarolo, Dalila B.M.M. Fontes, 2017 .

Using critical sets to solve the maximum independent set problem

Sergiy Butenko, Svyatoslav Trukhanov, S. Butenko, 2007, Oper. Res. Lett..

Clique Relaxation Models in Social Network Analysis

Sergiy Butenko, Jeffrey Pattillo, Nataly Youssef, 2012 .

Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem

Sergiy Butenko, Illya V. Hicks, Balabhaskar Balasundaram, 2011, Oper. Res..

Using Critical Sets for the Maximum Independent Set Problem Solving

Sergiy Butenko, Svyatoslav Trukhanov, S. Butenko, 2005 .

Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs

Eduardo L. Pasiliao, Oleg A. Prokopyev, Sergiy Butenko, 2016, Comput. Optim. Appl..

A network-based data mining approach to portfolio selection via weighted clique relaxations

Sergiy Butenko, Jaime Gil-Lafuente, Vladimir Boginski, 2014, Ann. Oper. Res..

Computational study of the US stock market evolution: a rank correlation-based network model

Sergiy Butenko, Vladimir Boginski, Oleg Shirokikh, 2013, Computational Management Science.

On imposing connectivity constraints in integer programs

Yiming Wang, Sergiy Butenko, Austin Buchanan, 2017, Mathematical Programming.

Checking solvability of systems of interval linear equations and inequalities via mixed integer programming

Oleg A. Prokopyev, Sergiy Butenko, Andrew C. Trapp, 2009, Eur. J. Oper. Res..

Optimal Security Liquidation Algorithms

Stan Uryasev, Sergiy Butenko, Alexander Golodnikov, 2005, Comput. Optim. Appl..

A Heuristic for the Maximum Independent Set Problem Based on Optimization of a Quadratic Over a Sphere

Panos M. Pardalos, Stanislav Busygin, Sergiy Butenko, 2002, J. Comb. Optim..

Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph

Yiming Wang, Sergiy Butenko, Austin Buchanan, 2018, Networks.

Graph Domination, Coloring and Cliques in Telecommunications

Sergiy Butenko, Balabhaskar Balasundaram, S. Butenko, 2006, Handbook of Optimization in Telecommunications.

On provably best construction heuristics for hard combinatorial optimization problems

Oleg A. Prokopyev, Sergiy Butenko, Austin Buchanan, 2016, Networks.

REACTIVE GRASP WITH PATH RELINKING FOR BROADCAST SCHEDULING

Panos M. Pardalos, Clayton W. Commander, Carlos A. S. Oliveira, 2004 .

ON THE PERFORMANCE OF HEURISTICS FOR BROADCAST SCHEDULING

Panos M. Pardalos, Clayton W. Commander, Sergiy Butenko, 2004 .

Network models of massive datasets

Panos M. Pardalos, Sergiy Butenko, Vladimir Boginski, 2004, Comput. Sci. Inf. Syst..

Extended Frontiers in Optimization Techniques

Panos M. Pardalos, Sergiy Butenko, P. Pardalos, 2004 .

A Greedy Randomized Adaptive Search Procedure for the Broadcast Scheduling Problem

Panos M. Pardalos, Clayton W. Commander, P. Pardalos, 2003 .

The maximum number of induced open triangles in graphs of a given order

Sergiy Butenko, Eugene Lykhovyd, Artem Pyatkin, 2018, Optim. Lett..

Finding maximum independent sets in graphs arising from coding theory

Panos M. Pardalos, Sergiy Butenko, Petro Stetsyuk, 2002, SAC '02.

Algorithms for the maximum k-club problem in graphs

Sergiy Butenko, Shahram Shahinpour, S. Butenko, 2013, J. Comb. Optim..

On k-club and k-clique numbers in graphs

S. Butenko, O. Prokopyev, 2007 .

Scale Reduction Techniques for Computing Maximum Induced Bicliques

Sergiy Butenko, Zeynep Ertem, Shirin Shirvani, 2017, Algorithms.

Statistical analysis of $nancial networks

Panos M. Pardalos, Sergiy Butenko, P. Pardalos, 2005 .

NETWORK-BASED TECHNIQUES IN THE ANALYSIS OF THE STOCK MARKET

Panos M. Pardalos, Sergiy Butenko, Vladimir Boginski, 2004 .

Risk-based maintenance and rehabilitation decisions for transportation infrastructure networks

Ivan Damnjanovic, Sergiy Butenko, S. Reza Seyedshohadaie, 2010 .

Solving maximum clique in sparse graphs: an $$O(nm+n2^{d/4})$$O(nm+n2d/4) algorithm for $$d$$d-degenerate graphs

Panos M. Pardalos, Sergiy Butenko, Austin Buchanan, 2014, Optim. Lett..

On the Construction of Virtual Backbone for Ad Hoc Wireless Network

Panos M. Pardalos, Ding-Zhu Du, Xiuzhen Cheng, 2003 .

An Improved Approximation for Maximum k-Dependent Set on Bipartite Graphs pdf

Seyedmohammadhossein Hosseinian, Sergiy Butenko, S. Butenko, 2021, Discret. Appl. Math..

Impact of Reconstruction Strategies on System Performance Measures: Maximizing Safety and Mobility While Minimizing Life-Cycle Costs

S. Butenko, I. Damnjanovic, A. Wimsatt, 2008 .