☰

Sergiy Butenko - Publications

Affiliations: 
Texas A & M University, College Station, TX, United States 
Area:
Industrial Engineering, Applied Mathematics
Website:
https://butenko.engr.tamu.edu/
Tree Info Similar researchers PubMed Report error

58 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Hosseinian S, Fontes DBMM, Butenko S. A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem Informs Journal On Computing. 32: 747-762. DOI: 10.1287/Ijoc.2019.0898  0.515
2020 Ertem Z, Lykhovyd E, Wang Y, Butenko S. The maximum independent union of cliques problem: complexity and exact approaches Journal of Global Optimization. 76: 545-562. DOI: 10.1007/S10898-018-0694-2  0.633
2020 Veremyev A, Liyanage L, Fornari M, Boginski V, Curtarolo S, Butenko S, Nardelli MB. Networks of Materials: Construction and Structural Analysis Aiche Journal. DOI: 10.1002/Aic.17051  0.674
2019 Hosseinian S, Butenko S. Algorithms for the generalized independent set problem based on a quadratic optimization approach Optimization Letters. 13: 1211-1222. DOI: 10.1007/S11590-019-01418-9  0.495
2019 Pyatkin AV, Lykhovyd E, Butenko S. The maximum number of induced open triangles in graphs of a given order Optimization Letters. 13: 1927-1935. DOI: 10.1007/S11590-018-1330-2  0.458
2019 Yezerska O, Pajouh FM, Veremyev A, Butenko S. Exact algorithms for the minimum s -club partitioning problem Annals of Operations Research. 276: 267-291. DOI: 10.1007/S10479-017-2665-2  0.575
2018 Hosseinian S, Fontes DBMM, Butenko S. A nonconvex quadratic optimization approach to the maximum edge weight clique problem Journal of Global Optimization. 72: 219-240. DOI: 10.1007/S10898-018-0630-5  0.598
2018 Buchanan A, Wang Y, Butenko S. Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph Networks. 72: 238-248. DOI: 10.1002/Net.21825  0.374
2017 Shahinpour S, Shirvani S, Ertem Z, Butenko S. Scale Reduction Techniques for Computing Maximum Induced Bicliques Algorithms. 10: 113. DOI: 10.3390/A10040113  0.622
2017 Yezerska O, Pajouh FM, Butenko S. On biconnected and fragile subgraphs of low diameter European Journal of Operational Research. 263: 390-400. DOI: 10.1016/J.Ejor.2017.05.020  0.579
2017 Wang Y, Buchanan A, Butenko S. On imposing connectivity constraints in integer programs Mathematical Programming. 166: 241-271. DOI: 10.1007/S10107-017-1117-8  0.494
2016 Ertem Z, Veremyev A, Butenko S. Detecting large cohesive subgroups with high clustering coefficients in social networks Social Networks. 46: 1-10. DOI: 10.1016/J.Socnet.2016.01.001  0.316
2016 Butenko S. Journal of Global Optimization Best Paper Award for 2015 Journal of Global Optimization. 66: 595-596. DOI: 10.1007/S10898-016-0479-4  0.42
2016 Veremyev A, Prokopyev OA, Butenko S, Pasiliao EL. Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs Computational Optimization and Applications. 64: 177-214. DOI: 10.1007/S10589-015-9804-Y  0.783
2016 Yezerska O, Butenko S, Boginski VL. Detecting robust cliques in graphs subject to uncertain edge failures Annals of Operations Research. 1-24. DOI: 10.1007/S10479-016-2161-0  0.786
2016 Kahruman-Anderoglu S, Buchanan A, Butenko S, Prokopyev OA. On provably best construction heuristics for hard combinatorial optimization problems Networks. 67: 238-245. DOI: 10.1002/Net.21620  0.816
2015 Buchanan A, Sung JS, Butenko S, Pasiliao EL. An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets Informs Journal On Computing. 27: 178-188. DOI: 10.1287/Ijoc.2014.0619  0.745
2015 Verma A, Buchanan A, Butenko S. Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks Informs Journal On Computing. 27: 164-177. DOI: 10.1287/Ijoc.2014.0618  0.672
2015 Balasubramaniam C, Butenko S. On robust clusters of minimum cardinality in networks Annals of Operations Research. DOI: 10.1007/S10479-015-1992-4  0.508
2014 Buchanan A, Sung JS, Boginski V, Butenko S. On connected dominating sets of restricted diameter European Journal of Operational Research. 236: 410-418. DOI: 10.1016/J.Ejor.2013.11.036  0.787
2014 Pattillo J, Wang Y, Butenko S. Approximating 2-cliques in unit disk graphs Discrete Applied Mathematics. 166: 178-187. DOI: 10.1016/J.Dam.2013.10.017  0.823
2014 Buchanan A, Walteros JL, Butenko S, Pardalos PM. Solving maximum clique in sparse graphs: An O(nm+n2d/4) algorithm for d-degenerate graphs Optimization Letters. 8: 1611-1617. DOI: 10.1007/S11590-013-0698-2  0.528
2014 Boginski V, Butenko S, Shirokikh O, Trukhanov S, Gil Lafuente J. A network-based data mining approach to portfolio selection via weighted clique relaxations Annals of Operations Research. 216: 23-34. DOI: 10.1007/S10479-013-1395-3  0.785
2013 Pattillo J, Youssef N, Butenko S. On clique relaxation models in network analysis European Journal of Operational Research. 226: 9-18. DOI: 10.1016/J.Ejor.2012.10.021  0.79
2013 Pattillo J, Veremyev A, Butenko S, Boginski V. On the maximum quasi-clique problem Discrete Applied Mathematics. 161: 244-257. DOI: 10.1016/J.Dam.2012.07.019  0.801
2013 Ursulenko O, Butenko S, Prokopyev OA. A global optimization algorithm for solving the minimum multiple ratio spanning tree problem Journal of Global Optimization. 56: 1029-1043. DOI: 10.1007/S10898-011-9832-9  0.799
2013 Shahinpour S, Butenko S. Algorithms for the maximum k-club problem in graphs Journal of Combinatorial Optimization. 26: 520-554. DOI: 10.1007/S10878-012-9473-Z  0.538
2013 Butenko S, Yezerska O, Balasundaram B. Variable objective search Journal of Heuristics. 19: 697-709. DOI: 10.1007/S10732-011-9174-2  0.745
2013 Trukhanov S, Balasubramaniam C, Balasundaram B, Butenko S. Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations Computational Optimization and Applications. 56: 113-130. DOI: 10.1007/S10589-013-9548-5  0.846
2013 Sethuraman S, Butenko S. The maximum ratio clique problem Computational Management Science. 1-22. DOI: 10.1007/S10287-013-0197-Z  0.532
2013 Shirokikh O, Pastukhov G, Boginski V, Butenko S. Computational study of the US stock market evolution: A rank correlation-based network model Computational Management Science. 10: 81-103. DOI: 10.1007/S10287-012-0160-4  0.723
2013 Shahinpour S, Butenko S. Distance-based clique relaxations in networks: S-clique and s-club Springer Proceedings in Mathematics and Statistics. 59: 149-173. DOI: 10.1007/978-1-4614-8588-9_10  0.347
2012 Verma A, Butenko S. A distributed approximation algorithm for the bottleneck connected dominating set problem Optimization Letters. 6: 1583-1595. DOI: 10.1007/S11590-011-0314-2  0.602
2012 Kahruman S, Ulusal E, Butenko S, Hicks IV, Diehl KM. Scheduling the adjuvant endocrine therapy for early stage breast cancer Annals of Operations Research. 196: 683-705. DOI: 10.1007/S10479-010-0741-Y  0.715
2012 Pattillo J, Youssef N, Butenko S. Clique relaxation models in social network analysis Springer Optimization and Its Applications. 58: 143-162. DOI: 10.1007/978-1-4614-0857-4_5  0.357
2011 Balasundaram B, Butenko S, Hicks IV. Clique relaxations in social network analysis: The maximum k-plex problem Operations Research. 59: 133-142. DOI: 10.1287/Opre.1100.0851  0.813
2011 Butenko S, Kahruman-Anderoglu S, Ursulenko O. On connected domination in unit ball graphs Optimization Letters. 5: 195-205. DOI: 10.1007/S11590-010-0211-0  0.753
2010 Seyedshohadaie SR, Damnjanovic I, Butenko S. Risk-based maintenance and rehabilitation decisions for transportation infrastructure networks Transportation Research Part a: Policy and Practice. 44: 236-248. DOI: 10.1016/J.Tra.2010.01.005  0.321
2010 Butenko S, Gil-Lafuente J, Pardalos PM. Preface Optimal Strategies in Sports Economics and Management. DOI: 10.1007/978-3-642-13205-6  0.558
2009 Butenko S, Art Chaovalitwongse W, Pardalos PM. Clustering challenges in biological networks Clustering Challenges in Biological Networks. 1-334. DOI: 10.1142/6602  0.533
2009 Prokopyev OA, Butenko S, Trapp A. Checking solvability of systems of interval linear equations and inequalities via mixed integer programming European Journal of Operational Research. 199: 117-121. DOI: 10.1016/J.Ejor.2008.11.008  0.374
2009 Butenko S. Comments on: Optimization and data mining in biomedicine Top. 17: 239-239. DOI: 10.1007/S11750-009-0127-Y  0.379
2009 Butenko S, Pardalos P, Sergienko I, Shylo V, Stetsyuk P. Estimating the size of correcting codes using extremal graph problems Springer Optimization and Its Applications. 32: 227-243. DOI: 10.1007/978-0-387-98096-6_12  0.434
2007 Kahruman S, Kolotoglu E, Butenko S, Hicks IV. On greedy construction heuristics for the MAX-CUT problem International Journal of Computational Science and Engineering. 3: 211-218. DOI: 10.1504/IJCSE.2007.017827  0.505
2007 Butenko S, Trukhanov S. Using critical sets to solve the maximum independent set problem Operations Research Letters. 35: 519-524. DOI: 10.1016/J.Orl.2006.07.004  0.751
2007 Balasundaram B, Butenko S. Network Clustering Analysis of Biological Networks. 113-138. DOI: 10.1002/9780470253489.ch6  0.625
2006 Butenko S, Wilhelm WE. Clique-detection models in computational biochemistry and genomics European Journal of Operational Research. 173: 1-17. DOI: 10.1016/J.Ejor.2005.05.026  0.509
2006 Boginski V, Butenko S, Pardalos PM. Mining market data: A network approach Computers and Operations Research. 33: 3171-3184. DOI: 10.1016/J.Cor.2005.01.027  0.714
2006 Balasundaram B, Butenko S. On a polynomial fractional formulation for independence number of a graph Journal of Global Optimization. 35: 405-421. DOI: 10.1007/S10898-005-5185-6  0.786
2005 Balasundaram B, Butenko S. Constructing test functions for global optimization using continuous formulations of graph problems Optimization Methods and Software. 20: 439-452. DOI: 10.1080/10556780500139641  0.759
2005 Boginski V, Butenko S, Pardalos PM. Statistical analysis of financial networks Computational Statistics and Data Analysis. 48: 431-443. DOI: 10.1016/J.Csda.2004.02.004  0.775
2005 Balasundaram B, Butenko S, Trukhanov S. Novel approaches for analyzing biological networks Journal of Combinatorial Optimization. 10: 23-39. DOI: 10.1007/s10878-005-1857-x  0.798
2005 Butenko S, Golodnikov A, Uryasev S. Optimal security liquidation algorithms Computational Optimization and Applications. 32: 9-27. DOI: 10.1007/S10589-005-2052-9  0.389
2004 Boginski V, Butenko S, Pardalos PM. Network Models of Massive Datasets Computer Science and Information Systems. 1: 75-89. DOI: 10.2298/Csis0401075B  0.758
2002 Busygin S, Butenko S, Pardalos PM. A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere Journal of Combinatorial Optimization. 6: 287-297. DOI: 10.1023/A:1014899909753  0.838
2002 Butenko S, Pardalos P, Sergienko I, Shylo V. Finding maximum independent sets in graphs arising from coding theory Proceedings of the Acm Symposium On Applied Computing. 542-546.  0.367
2001 Butenko S, Festa P, Pardalos PM. On the chromatic number of graphs Journal of Optimization Theory and Applications. 109: 51-67. DOI: 10.1023/A:1017557620292  0.727
2001 Abello J, Butenko S, Pardalos PM, Resende MGC. Finding independent sets in a graph using continuous multivariable polynomial formulations Journal of Global Optimization. 21: 111-137. DOI: 10.1023/A:1011968411281  0.488
Show low-probability matches.