Sergiy Butenko

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