Sergiy Butenko

According to our database1, Sergiy Butenko authored at least 55 papers between 2001 and 2019.

Collaborative distances:



In proceedings 
PhD thesis 




Exact algorithms for the minimum s-club partitioning problem.
Annals OR, 2019

The Maximum Clique and Vertex Coloring.
Proceedings of the Handbook of Heuristics., 2018

Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph.
Networks, 2018

A nonconvex quadratic optimization approach to the maximum edge weight clique problem.
J. Global Optimization, 2018

Detecting robust cliques in graphs subject to uncertain edge failures.
Annals OR, 2018

On imposing connectivity constraints in integer programs.
Math. Program., 2017

On biconnected and fragile subgraphs of low diameter.
European Journal of Operational Research, 2017

On robust clusters of minimum cardinality in networks.
Annals OR, 2017

Scale Reduction Techniques for Computing Maximum Induced Bicliques.
Algorithms, 2017

Detecting large cohesive subgroups with high clustering coefficients in social networks.
Social Networks, 2016

On provably best construction heuristics for hard combinatorial optimization problems.
Networks, 2016

Journal of Global Optimization Best Paper Award for 2015.
J. Global Optimization, 2016

Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs.
Comp. Opt. and Appl., 2016

Journal of Global Optimization Best Paper Award for a paper published in 2014.
J. Global Optimization, 2015

Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks.
INFORMS Journal on Computing, 2015

An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets.
INFORMS Journal on Computing, 2015

The maximum ratio clique problem.
Comput. Manag. Science, 2015

Solving maximum clique in sparse graphs: an O(nm+n2d/4 algorithm for d-degenerate graphs.
Optimization Letters, 2014

Journal of Global Optimization Best Paper Award for a paper published in 2013.
J. Global Optimization, 2014

Journal of Global Optimization Best Paper Award for a paper published in 2012.
J. Global Optimization, 2014

J. Comb. Optim., 2014

On connected dominating sets of restricted diameter.
European Journal of Operational Research, 2014

Approximating 2-cliques in unit disk graphs.
Discrete Applied Mathematics, 2014

A network-based data mining approach to portfolio selection via weighted clique relaxations.
Annals OR, 2014

A global optimization algorithm for solving the minimum multiple ratio spanning tree problem.
J. Global Optimization, 2013

2012 Journal of Global Optimization best paper award.
J. Global Optimization, 2013

Journal of global optimization: continuing the tradition of excellence.
J. Global Optimization, 2013

Algorithms for the maximum k-club problem in graphs.
J. Comb. Optim., 2013

Variable objective search.
J. Heuristics, 2013

On clique relaxation models in network analysis.
European Journal of Operational Research, 2013

On the maximum quasi-clique problem.
Discrete Applied Mathematics, 2013

Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations.
Comp. Opt. and Appl., 2013

Computational study of the US stock market evolution: a rank correlation-based network model.
Comput. Manag. Science, 2013

A distributed approximation algorithm for the bottleneck connected dominating set problem.
Optimization Letters, 2012

Scheduling the adjuvant endocrine therapy for early stage breast cancer.
Annals OR, 2012

Network clustering via clique relaxations: A community based approach.
Proceedings of the Graph Partitioning and Graph Clustering, 2012

On connected domination in unit ball graphs.
Optimization Letters, 2011

Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem.
Operations Research, 2011

Optimization Problems in Unit-Disk Graphs.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Checking solvability of systems of interval linear equations and inequalities via mixed integer programming.
European Journal of Operational Research, 2009

Using critical sets to solve the maximum independent set problem.
Oper. Res. Lett., 2007

On greedy construction heuristics for the MAX-CUT problem.
IJCSE, 2007

On a Polynomial Fractional Formulation for Independence Number of a Graph.
J. Global Optimization, 2006

Clique-detection models in computational biochemistry and genomics.
European Journal of Operational Research, 2006

Mining market data: A network approach.
Computers & OR, 2006

Graph Domination, Coloring and Cliques in Telecommunications.
Proceedings of the Handbook of Optimization in Telecommunications, 2006

Constructing test functions for global optimization using continuous formulations of graph problems.
Optimization Methods and Software, 2005

Novel Approaches for Analyzing Biological Networks.
J. Comb. Optim., 2005

Statistical analysis of financial networks.
Computational Statistics & Data Analysis, 2005

Optimal Security Liquidation Algorithms.
Comp. Opt. and Appl., 2005

Network models of massive datasets.
Comput. Sci. Inf. Syst., 2004

Nonlinear Dynamical Systems and Adaptive Filters in Biomedicine.
Annals OR, 2003

A Heuristic for the Maximum Independent Set Problem Based on Optimization of a Quadratic Over a Sphere.
J. Comb. Optim., 2002

Finding maximum independent sets in graphs arising from coding theory.
Proceedings of the 2002 ACM Symposium on Applied Computing (SAC), 2002

Finding independent sets in a graph using continuous multivariable polynomial formulations.
J. Global Optimization, 2001