Sergiy Butenko
Affiliations: | Texas A & M University, College Station, TX, United States |
Area:
Industrial Engineering, Applied MathematicsWebsite:
https://butenko.engr.tamu.edu/Google:
"Sergiy Butenko"Bio:
https://www.proquest.com/openview/0cc23a9111afa43c764c823ea482ecbd/1
Parents
Sign in to add mentor| Panos M. Pardalos | grad student | 2003 | UF Gainesville (Computer Science Tree) | |
| (Maximum independent set and related problems, with applications) | ||||
Children
Sign in to add trainee| Balabhaskar Balasundaram | grad student | 2007 | Texas A & M |
| Svyatoslav Trukhanov | grad student | 2008 | Texas A & M |
| Elif Ulusal | grad student | 2008 | Texas A & M |
| Sera Kahruman-Anderoglu | grad student | 2009 | Texas A & M |
| Oleksii Ursulenko | grad student | 2009 | Texas A & M |
| Jeffrey L. Pattillo | grad student | 2011 | Texas A & M |
| Seyed R. Seyedolshohadaie | grad student | 2011 | Texas A & M |
| Anurag Verma | grad student | 2012 | Texas A & M |
| Jorge Ignacio Cisneros Saldana | grad student | 2016-2018 | Texas A & M (E-Tree) |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Hosseinian S, Fontes DBMM, Butenko S. (2020) 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 |
| Ertem Z, Lykhovyd E, Wang Y, et al. (2020) The maximum independent union of cliques problem: complexity and exact approaches Journal of Global Optimization. 76: 545-562 |
| Veremyev A, Liyanage L, Fornari M, et al. (2020) Networks of Materials: Construction and Structural Analysis Aiche Journal |
| Hosseinian S, Butenko S. (2019) Algorithms for the generalized independent set problem based on a quadratic optimization approach Optimization Letters. 13: 1211-1222 |
| Pyatkin AV, Lykhovyd E, Butenko S. (2019) The maximum number of induced open triangles in graphs of a given order Optimization Letters. 13: 1927-1935 |
| Yezerska O, Pajouh FM, Veremyev A, et al. (2019) Exact algorithms for the minimum s -club partitioning problem Annals of Operations Research. 276: 267-291 |
| Hosseinian S, Fontes DBMM, Butenko S. (2018) A nonconvex quadratic optimization approach to the maximum edge weight clique problem Journal of Global Optimization. 72: 219-240 |
| Buchanan A, Wang Y, Butenko S. (2018) Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph Networks. 72: 238-248 |
| Shahinpour S, Shirvani S, Ertem Z, et al. (2017) Scale Reduction Techniques for Computing Maximum Induced Bicliques Algorithms. 10: 113 |
| Yezerska O, Pajouh FM, Butenko S. (2017) On biconnected and fragile subgraphs of low diameter European Journal of Operational Research. 263: 390-400 |