Sergiy Butenko

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 28

Top Topics

Bipartite Graph

Integer Program

Top Venues

J. Glob. Optim.

Ann. Oper. Res.

Publications

Eugene Lykhovyd, Sergiy Butenko, Pavlo A. Krokhmal
Asymptotic bounds for clustering problems in random graphs. Networks 83 (3) (2024)
Abdullah Alsulieman, Xihe Ge, Zhiguo Zeng, Sergiy Butenko, Faisal Khan, Mahmoud M. El-Halwagi
Dynamic risk analysis of evolving scenarios in oil and gas separator. Reliab. Eng. Syst. Saf. 243 (2024)
Richard Cory Allen, Styliani Avraamidou, Sergiy Butenko, Efstratios N. Pistikopoulos
Solution strategies for integrated distribution, production, and relocation problems arising in modular manufacturing. Eur. J. Oper. Res. 314 (3) (2024)
Vladimir Stozhkov, Austin Buchanan, Sergiy Butenko, Vladimir Boginski
Continuous cubic formulations for cluster detection problems in networks. Math. Program. 196 (1) (2022)
Sergiy Butenko, Mykyta Makovenko, Panos M. Pardalos
A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem. SIAM J. Optim. 32 (3) (2022)
Yehor Blokhin, Sergiy Butenko, Petar Momcilovic, Oleg A. Prokopyev
On maximum ratio clique relaxations. Networks 80 (4) (2022)
Seyedmohammadhossein Hosseinian, Sergiy Butenko
An improved approximation for Maximumk-dependent Set on bipartite graphs. Discret. Appl. Math. 307 (2022)
Milad Soleimani, Mladen Kezunovic, Sergiy Butenko
Linear Arrhenius-Weibull Model for Power Transformer Thermal Stress Assessment. IEEE Access 10 (2022)
Seyedmohammadhossein Hosseinian, Sergiy Butenko
An Improved Approximation for Maximum k-Dependent Set on Bipartite Graphs. CoRR (2021)
Seyedmohammadhossein Hosseinian, Sergiy Butenko
Polyhedral properties of the induced cluster subgraphs. Discret. Appl. Math. 297 (2021)
Seyedmohammadhossein Hosseinian, Dalila B. M. M. Fontes, Sergiy Butenko
A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem. INFORMS J. Comput. 32 (3) (2020)
Zeynep Ertem, Eugene Lykhovyd, Yiming Wang, Sergiy Butenko
The maximum independent union of cliques problem: complexity and exact approaches. J. Glob. Optim. 76 (3) (2020)
Artem V. Pyatkin, Eugene Lykhovyd, Sergiy Butenko
The maximum number of induced open triangles in graphs of a given order. Optim. Lett. 13 (8) (2019)
Oleksandra Yezerska, Foad Mahdavi Pajouh, Alexander Veremyev, Sergiy Butenko
Exact algorithms for the minimum s-club partitioning problem. Ann. Oper. Res. 276 (1-2) (2019)
Sergiy Butenko, Efstratios N. Pistikopoulos
Preface. J. Glob. Optim. 74 (4) (2019)
Seyedmohammadhossein Hosseinian, Sergiy Butenko
Algorithms for the generalized independent set problem based on a quadratic optimization approach. Optim. Lett. 13 (6) (2019)
Seyedmohammadhossein Hosseinian, Sergiy Butenko
Polyhedral Properties of the Induced Cluster Subgraphs. CoRR (2019)
Austin Buchanan, Yiming Wang, Sergiy Butenko
Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph. Networks 72 (2) (2018)
Oleksandra Yezerska, Sergiy Butenko, Vladimir Boginski
Detecting robust cliques in graphs subject to uncertain edge failures. Ann. Oper. Res. 262 (1) (2018)
Seyedmohammadhossein Hosseinian, Dalila B. M. M. Fontes, Sergiy Butenko
A nonconvex quadratic optimization approach to the maximum edge weight clique problem. J. Glob. Optim. 72 (2) (2018)
Yiming Wang, Austin Buchanan, Sergiy Butenko
On imposing connectivity constraints in integer programs. Math. Program. 166 (1-2) (2017)
Shahram Shahinpour, Shirin Shirvani, Zeynep Ertem, Sergiy Butenko
Scale Reduction Techniques for Computing Maximum Induced Bicliques. Algorithms 10 (4) (2017)
Oleksandra Yezerska, Foad Mahdavi Pajouh, Sergiy Butenko
On biconnected and fragile subgraphs of low diameter. Eur. J. Oper. Res. 263 (2) (2017)
Chitra Balasubramaniam, Sergiy Butenko
On robust clusters of minimum cardinality in networks. Ann. Oper. Res. 249 (1-2) (2017)
Alexander Veremyev, Oleg A. Prokopyev, Sergiy Butenko, Eduardo L. Pasiliao
Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs. Comput. Optim. Appl. 64 (1) (2016)
Zeynep Ertem, Alexander Veremyev, Sergiy Butenko
Detecting large cohesive subgroups with high clustering coefficients in social networks. Soc. Networks 46 (2016)
Sera Kahruman-Anderoglu, Austin Buchanan, Sergiy Butenko, Oleg A. Prokopyev
On provably best construction heuristics for hard combinatorial optimization problems. Networks 67 (3) (2016)
Sergiy Butenko
Journal of Global Optimization Best Paper Award for 2015. J. Glob. Optim. 66 (4) (2016)
Samyukta Sethuraman, Sergiy Butenko
The maximum ratio clique problem. Comput. Manag. Sci. 12 (1) (2015)
Austin Buchanan, Je Sang Sung, Sergiy Butenko, Eduardo L. Pasiliao
An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets. INFORMS J. Comput. 27 (1) (2015)
Anurag Verma, Austin Buchanan, Sergiy Butenko
Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks. INFORMS J. Comput. 27 (1) (2015)
Sergiy Butenko
Journal of Global Optimization Best Paper Award for a paper published in 2014. J. Glob. Optim. 63 (4) (2015)
Sergiy Butenko
Journal of Global Optimization Best Paper Award for a paper published in 2013. J. Glob. Optim. 60 (4) (2014)
Vladimir Boginski, Sergiy Butenko, Oleg Shirokikh, Svyatoslav Trukhanov, Jaime Gil-Lafuente
A network-based data mining approach to portfolio selection via weighted clique relaxations. Ann. Oper. Res. 216 (1) (2014)
Sergiy Butenko
Journal of Global Optimization Best Paper Award for a paper published in 2012. J. Glob. Optim. 58 (2) (2014)
Sergiy Butenko, Ding-Zhu Du, Mauricio G. C. Resende
Preface. J. Comb. Optim. 28 (1) (2014)
Austin Buchanan, Jose L. Walteros, Sergiy Butenko, Panos M. Pardalos
algorithm for d-degenerate graphs. Optim. Lett. 8 (5) (2014)
Jeffrey Pattillo, Yiming Wang, Sergiy Butenko
Approximating 2-cliques in unit disk graphs. Discret. Appl. Math. 166 (2014)
Austin Buchanan, Je Sang Sung, Vladimir Boginski, Sergiy Butenko
On connected dominating sets of restricted diameter. Eur. J. Oper. Res. 236 (2) (2014)
Oleksii Ursulenko, Sergiy Butenko, Oleg A. Prokopyev
A global optimization algorithm for solving the minimum multiple ratio spanning tree problem. J. Glob. Optim. 56 (3) (2013)
Jeffrey Pattillo, Alexander Veremyev, Sergiy Butenko, Vladimir Boginski
On the maximum quasi-clique problem. Discret. Appl. Math. 161 (1-2) (2013)
Svyatoslav Trukhanov, Chitra Balasubramaniam, Balabhaskar Balasundaram, Sergiy Butenko
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations. Comput. Optim. Appl. 56 (1) (2013)
Jeffrey Pattillo, Nataly Youssef, Sergiy Butenko
On clique relaxation models in network analysis. Eur. J. Oper. Res. 226 (1) (2013)
Oleg Shirokikh, Grigory Pastukhov, Vladimir Boginski, Sergiy Butenko
Computational study of the US stock market evolution: a rank correlation-based network model. Comput. Manag. Sci. 10 (2-3) (2013)
Sergiy Butenko
Journal of global optimization: continuing the tradition of excellence. J. Glob. Optim. 55 (1) (2013)
Sergiy Butenko
2012 Journal of Global Optimization best paper award. J. Glob. Optim. 55 (3) (2013)
Sergiy Butenko, Oleksandra Yezerska, Balabhaskar Balasundaram
Variable objective search. J. Heuristics 19 (4) (2013)
Shahram Shahinpour, Sergiy Butenko
Algorithms for the maximum k-club problem in graphs. J. Comb. Optim. 26 (3) (2013)
Anurag Verma, Sergiy Butenko
Network clustering via clique relaxations: A community based approach. Graph Partitioning and Graph Clustering (2012)
Sera Kahruman-Anderoglu, Elif Ulusal, Sergiy Butenko, Illya V. Hicks, Kathleen M. Diehl
Scheduling the adjuvant endocrine therapy for early stage breast cancer. Ann. Oper. Res. 196 (1) (2012)
Anurag Verma, Sergiy Butenko
A distributed approximation algorithm for the bottleneck connected dominating set problem. Optim. Lett. 6 (8) (2012)
Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii Ursulenko
On connected domination in unit ball graphs. Optim. Lett. 5 (2) (2011)
Balabhaskar Balasundaram, Sergiy Butenko, Illya V. Hicks
-Plex Problem. Oper. Res. 59 (1) (2011)
Oleg A. Prokopyev, Sergiy Butenko, Andrew C. Trapp
Checking solvability of systems of interval linear equations and inequalities via mixed integer programming. Eur. J. Oper. Res. 199 (1) (2009)
Sergiy Butenko, Svyatoslav Trukhanov
Using critical sets to solve the maximum independent set problem. Oper. Res. Lett. 35 (4) (2007)
Sera Kahruman-Anderoglu, Elif Kolotoglu, Sergiy Butenko, Illya V. Hicks
On greedy construction heuristics for the MAX-CUT problem. Int. J. Comput. Sci. Eng. 3 (3) (2007)
Vladimir Boginski, Sergiy Butenko, Panos M. Pardalos
Mining market data: A network approach. Comput. Oper. Res. 33 (11) (2006)
Balabhaskar Balasundaram, Sergiy Butenko
On a Polynomial Fractional Formulation for Independence Number of a Graph. J. Glob. Optim. 35 (3) (2006)
Sergiy Butenko, Wilbert E. Wilhelm
Clique-detection models in computational biochemistry and genomics. Eur. J. Oper. Res. 173 (1) (2006)
Balabhaskar Balasundaram, Sergiy Butenko
Constructing test functions for global optimization using continuous formulations of graph problems. Optim. Methods Softw. 20 (4-5) (2005)
Sergiy Butenko, Alexander Golodnikov, Stanislav Uryasev
Optimal Security Liquidation Algorithms. Comput. Optim. Appl. 32 (1-2) (2005)
Balabhaskar Balasundaram, Sergiy Butenko, Svyatoslav Trukhanov
Novel Approaches for Analyzing Biological Networks. J. Comb. Optim. 10 (1) (2005)
Vladimir Boginski, Sergiy Butenko, Panos M. Pardalos
Statistical analysis of financial networks. Comput. Stat. Data Anal. 48 (2) (2005)
Vladimir Boginski, Sergiy Butenko, Panos M. Pardalos
Network models of massive datasets. Comput. Sci. Inf. Syst. 1 (1) (2004)
Panos M. Pardalos, J. Chris Sackellares, Vitaliy A. Yatsenko, Sergiy Butenko
Nonlinear Dynamical Systems and Adaptive Filters in Biomedicine. Ann. Oper. Res. 119 (1-4) (2003)
Sergiy Butenko, Panos M. Pardalos, Ivan Sergienko, Vladimir Shylo, Petro Stetsyuk
Finding maximum independent sets in graphs arising from coding theory. SAC (2002)
Stanislav Busygin, Sergiy Butenko, Panos M. Pardalos
A Heuristic for the Maximum Independent Set Problem Based on Optimization of a Quadratic Over a Sphere. J. Comb. Optim. 6 (3) (2002)
James Abello, Sergiy Butenko, Panos M. Pardalos, Mauricio G. C. Resende
Finding independent sets in a graph using continuous multivariable polynomial formulations. J. Glob. Optim. 21 (2) (2001)