default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergiy Butenko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j64]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): 963-979 (2024)- [j63]Eugene Lykhovyd, Sergiy Butenko, Pavlo A. Krokhmal:
Asymptotic bounds for clustering problems in random graphs. Networks 83(3): 485-502 (2024) - [j62]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: 109834 (2024) - 2022
- [j61]Milad Soleimani, Mladen Kezunovic, Sergiy Butenko:
Linear Arrhenius-Weibull Model for Power Transformer Thermal Stress Assessment. IEEE Access 10: 19013-19021 (2022) - [j60]Seyedmohammadhossein Hosseinian, Sergiy Butenko:
An improved approximation for Maximumk-dependent Set on bipartite graphs. Discret. Appl. Math. 307: 95-101 (2022) - [j59]Vladimir Stozhkov, Austin Buchanan, Sergiy Butenko, Vladimir Boginski:
Continuous cubic formulations for cluster detection problems in networks. Math. Program. 196(1): 279-307 (2022) - [j58]Yehor Blokhin, Sergiy Butenko, Petar Momcilovic, Oleg A. Prokopyev:
On maximum ratio clique relaxations. Networks 80(4): 440-465 (2022) - [j57]Sergiy Butenko, Mykyta Makovenko, Panos M. Pardalos:
A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem. SIAM J. Optim. 32(3): 2102-2128 (2022) - 2021
- [j56]Seyedmohammadhossein Hosseinian, Sergiy Butenko:
Polyhedral properties of the induced cluster subgraphs. Discret. Appl. Math. 297: 80-96 (2021) - [i2]Seyedmohammadhossein Hosseinian, Sergiy Butenko:
An Improved Approximation for Maximum k-Dependent Set on Bipartite Graphs. CoRR abs/2110.02487 (2021) - 2020
- [j55]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): 747-762 (2020) - [j54]Zeynep Ertem, Eugene Lykhovyd, Yiming Wang, Sergiy Butenko:
The maximum independent union of cliques problem: complexity and exact approaches. J. Glob. Optim. 76(3): 545-562 (2020)
2010 – 2019
- 2019
- [j53]Oleksandra Yezerska, Foad Mahdavi Pajouh, Alexander Veremyev, Sergiy Butenko:
Exact algorithms for the minimum s-club partitioning problem. Ann. Oper. Res. 276(1-2): 267-291 (2019) - [j52]Sergiy Butenko, Efstratios N. Pistikopoulos:
Preface. J. Glob. Optim. 74(4): 597-598 (2019) - [j51]Seyedmohammadhossein Hosseinian, Sergiy Butenko:
Algorithms for the generalized independent set problem based on a quadratic optimization approach. Optim. Lett. 13(6): 1211-1222 (2019) - [j50]Artem V. Pyatkin, Eugene Lykhovyd, Sergiy Butenko:
The maximum number of induced open triangles in graphs of a given order. Optim. Lett. 13(8): 1927-1935 (2019) - [i1]Seyedmohammadhossein Hosseinian, Sergiy Butenko:
Polyhedral Properties of the Induced Cluster Subgraphs. CoRR abs/1904.12025 (2019) - 2018
- [j49]Oleksandra Yezerska, Sergiy Butenko, Vladimir Boginski:
Detecting robust cliques in graphs subject to uncertain edge failures. Ann. Oper. Res. 262(1): 109-132 (2018) - [j48]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): 219-240 (2018) - [j47]Austin Buchanan, Yiming Wang, Sergiy Butenko:
Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph. Networks 72(2): 238-248 (2018) - [e2]Shaojie Tang, Ding-Zhu Du, David L. Woodruff, Sergiy Butenko:
Algorithmic Aspects in Information and Management - 12th International Conference, AAIM 2018, Dallas, TX, USA, December 3-4, 2018, Proceedings. Lecture Notes in Computer Science 11343, Springer 2018, ISBN 978-3-030-04617-0 [contents] - [r2]Oleksandra Yezerska, Sergiy Butenko:
The Maximum Clique and Vertex Coloring. Handbook of Heuristics 2018: 1259-1289 - 2017
- [j46]Shahram Shahinpour, Shirin Shirvani, Zeynep Ertem, Sergiy Butenko:
Scale Reduction Techniques for Computing Maximum Induced Bicliques. Algorithms 10(4): 113 (2017) - [j45]Chitra Balasubramaniam, Sergiy Butenko:
On robust clusters of minimum cardinality in networks. Ann. Oper. Res. 249(1-2): 17-37 (2017) - [j44]Oleksandra Yezerska, Foad Mahdavi Pajouh, Sergiy Butenko:
On biconnected and fragile subgraphs of low diameter. Eur. J. Oper. Res. 263(2): 390-400 (2017) - [j43]Yiming Wang, Austin Buchanan, Sergiy Butenko:
On imposing connectivity constraints in integer programs. Math. Program. 166(1-2): 241-271 (2017) - 2016
- [j42]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): 177-214 (2016) - [j41]Sergiy Butenko:
Journal of Global Optimization Best Paper Award for 2015. J. Glob. Optim. 66(4): 595-596 (2016) - [j40]Sera Kahruman-Anderoglu, Austin Buchanan, Sergiy Butenko, Oleg A. Prokopyev:
On provably best construction heuristics for hard combinatorial optimization problems. Networks 67(3): 238-245 (2016) - [j39]Zeynep Ertem, Alexander Veremyev, Sergiy Butenko:
Detecting large cohesive subgroups with high clustering coefficients in social networks. Soc. Networks 46: 1-10 (2016) - 2015
- [j38]Samyukta Sethuraman, Sergiy Butenko:
The maximum ratio clique problem. Comput. Manag. Sci. 12(1): 197-218 (2015) - [j37]Anurag Verma, Austin Buchanan, Sergiy Butenko:
Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks. INFORMS J. Comput. 27(1): 164-177 (2015) - [j36]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): 178-188 (2015) - [j35]Sergiy Butenko:
Journal of Global Optimization Best Paper Award for a paper published in 2014. J. Glob. Optim. 63(4): 631-632 (2015) - 2014
- [j34]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): 23-34 (2014) - [j33]Jeffrey Pattillo, Yiming Wang, Sergiy Butenko:
Approximating 2-cliques in unit disk graphs. Discret. Appl. Math. 166: 178-187 (2014) - [j32]Austin Buchanan, Je Sang Sung, Vladimir Boginski, Sergiy Butenko:
On connected dominating sets of restricted diameter. Eur. J. Oper. Res. 236(2): 410-418 (2014) - [j31]Sergiy Butenko, Ding-Zhu Du, Mauricio G. C. Resende:
Preface. J. Comb. Optim. 28(1): 1-2 (2014) - [j30]Sergiy Butenko:
Journal of Global Optimization Best Paper Award for a paper published in 2012. J. Glob. Optim. 58(2): 205 (2014) - [j29]Sergiy Butenko:
Journal of Global Optimization Best Paper Award for a paper published in 2013. J. Glob. Optim. 60(4): 597-598 (2014) - [j28]Austin Buchanan, Jose L. Walteros, Sergiy Butenko, Panos M. Pardalos:
Solving maximum clique in sparse graphs: an O(nm+n2d/4 algorithm for d-degenerate graphs. Optim. Lett. 8(5): 1611-1617 (2014) - [e1]Sergiy Butenko, Eduardo L. Pasiliao, Volodymyr Shylo:
Examining Robustness and Vulnerability of Networked Systems. NATO Science for Peace and Security Series, D: Information and Communication Security 37, IOS Press 2014, ISBN 978-1-61499-390-2 [contents] - 2013
- [j27]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): 81-103 (2013) - [j26]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): 113-130 (2013) - [j25]Jeffrey Pattillo, Alexander Veremyev, Sergiy Butenko, Vladimir Boginski:
On the maximum quasi-clique problem. Discret. Appl. Math. 161(1-2): 244-257 (2013) - [j24]Jeffrey Pattillo, Nataly Youssef, Sergiy Butenko:
On clique relaxation models in network analysis. Eur. J. Oper. Res. 226(1): 9-18 (2013) - [j23]Sergiy Butenko, Oleksandra Yezerska, Balabhaskar Balasundaram:
Variable objective search. J. Heuristics 19(4): 697-709 (2013) - [j22]Shahram Shahinpour, Sergiy Butenko:
Algorithms for the maximum k-club problem in graphs. J. Comb. Optim. 26(3): 520-554 (2013) - [j21]Sergiy Butenko:
Journal of global optimization: continuing the tradition of excellence. J. Glob. Optim. 55(1): 1-2 (2013) - [j20]Sergiy Butenko:
2012 Journal of Global Optimization best paper award. J. Glob. Optim. 55(3): 489-490 (2013) - [j19]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): 1029-1043 (2013) - 2012
- [j18]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): 683-705 (2012) - [j17]Anurag Verma, Sergiy Butenko:
A distributed approximation algorithm for the bottleneck connected dominating set problem. Optim. Lett. 6(8): 1583-1595 (2012) - [c2]Anurag Verma, Sergiy Butenko:
Network clustering via clique relaxations: A community based approach. Graph Partitioning and Graph Clustering 2012: 129-140 - 2011
- [j16]Balabhaskar Balasundaram, Sergiy Butenko, Illya V. Hicks:
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem. Oper. Res. 59(1): 133-142 (2011) - [j15]Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii Ursulenko:
On connected domination in unit ball graphs. Optim. Lett. 5(2): 195-205 (2011)
2000 – 2009
- 2009
- [j14]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): 117-121 (2009) - [r1]Balabhaskar Balasundaram, Sergiy Butenko:
Optimization Problems in Unit-Disk Graphs. Encyclopedia of Optimization 2009: 2832-2844 - 2007
- [j13]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): 211-218 (2007) - [j12]Sergiy Butenko, Svyatoslav Trukhanov:
Using critical sets to solve the maximum independent set problem. Oper. Res. Lett. 35(4): 519-524 (2007) - 2006
- [j11]Vladimir Boginski, Sergiy Butenko, Panos M. Pardalos:
Mining market data: A network approach. Comput. Oper. Res. 33(11): 3171-3184 (2006) - [j10]Sergiy Butenko, Wilbert E. Wilhelm:
Clique-detection models in computational biochemistry and genomics. Eur. J. Oper. Res. 173(1): 1-17 (2006) - [j9]Balabhaskar Balasundaram, Sergiy Butenko:
On a Polynomial Fractional Formulation for Independence Number of a Graph. J. Glob. Optim. 35(3): 405-421 (2006) - [p1]Balabhaskar Balasundaram, Sergiy Butenko:
Graph Domination, Coloring and Cliques in Telecommunications. Handbook of Optimization in Telecommunications 2006: 865-890 - 2005
- [j8]Sergiy Butenko, Alexander Golodnikov, Stanislav Uryasev:
Optimal Security Liquidation Algorithms. Comput. Optim. Appl. 32(1-2): 9-27 (2005) - [j7]Vladimir Boginski, Sergiy Butenko, Panos M. Pardalos:
Statistical analysis of financial networks. Comput. Stat. Data Anal. 48(2): 431-443 (2005) - [j6]Balabhaskar Balasundaram, Sergiy Butenko, Svyatoslav Trukhanov:
Novel Approaches for Analyzing Biological Networks. J. Comb. Optim. 10(1): 23-39 (2005) - [j5]Balabhaskar Balasundaram, Sergiy Butenko:
Constructing test functions for global optimization using continuous formulations of graph problems. Optim. Methods Softw. 20(4-5): 439-452 (2005) - 2004
- [j4]Vladimir Boginski, Sergiy Butenko, Panos M. Pardalos:
Network models of massive datasets. Comput. Sci. Inf. Syst. 1(1): 75-89 (2004) - 2003
- [j3]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): 119-142 (2003) - 2002
- [j2]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): 287-297 (2002) - [c1]Sergiy Butenko, Panos M. Pardalos, Ivan Sergienko, Vladimir Shylo, Petro Stetsyuk:
Finding maximum independent sets in graphs arising from coding theory. SAC 2002: 542-546 - 2001
- [j1]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): 111-137 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
