Sergiy Butenko

Texas A & M University, College Station, TX, United States 
Industrial Engineering, Applied Mathematics
"Sergiy Butenko"
BETA: Related 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.

Kahruman-Anderoglu S, Buchanan A, Butenko S, et al. (2016) On provably best construction heuristics for hard combinatorial optimization problems Networks. 67: 238-245
Boginski V, Butenko S, Shirokikh O, et al. (2014) A network-based data mining approach to portfolio selection via weighted clique relaxations Annals of Operations Research. 216: 23-34
Ursulenko O, Butenko S, Prokopyev OA. (2013) A global optimization algorithm for solving the minimum multiple ratio spanning tree problem Journal of Global Optimization. 56: 1029-1043
Butenko S, Yezerska O, Balasundaram B. (2013) Variable objective search Journal of Heuristics. 19: 697-709
Trukhanov S, Balasubramaniam C, Balasundaram B, et al. (2013) Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations Computational Optimization and Applications. 56: 113-130
Verma A, Butenko S. (2012) A distributed approximation algorithm for the bottleneck connected dominating set problem Optimization Letters. 6: 1583-1595
Kahruman S, Ulusal E, Butenko S, et al. (2012) Scheduling the adjuvant endocrine therapy for early stage breast cancer Annals of Operations Research. 196: 683-705
Balasundaram B, Butenko S, Hicks IV. (2011) Clique relaxations in social network analysis: The maximum k-plex problem Operations Research. 59: 133-142
Butenko S, Kahruman-Anderoglu S, Ursulenko O. (2011) On connected domination in unit ball graphs Optimization Letters. 5: 195-205
Butenko S, Trukhanov S. (2007) Using critical sets to solve the maximum independent set problem Operations Research Letters. 35: 519-524
See more...