Balabhaskar Balasundaram

发表

Network Clustering

Sergiy Butenko, Balabhaskar Balasundaram, S. Butenko, 2014, Encyclopedia of Social Network Analysis and Mining.

Constructing test functions for global optimization using continuous formulations of graph problems

Sergiy Butenko, Balabhaskar Balasundaram, S. Butenko, 2005, Optim. Methods Softw..

A Bayesian framework for functional calibration of expensive computational models through non-isometric matching

Balabhaskar Balasundaram, Arash Pourhabib, Austin Buchanan, 2015 .

Variable objective search

Sergiy Butenko, Balabhaskar Balasundaram, Oleksandra Yezerska, 2013, J. Heuristics.

Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations

Sergiy Butenko, Balabhaskar Balasundaram, Svyatoslav Trukhanov, 2013, Computational Optimization and Applications.

An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph

Balabhaskar Balasundaram, Zhuqi Miao, 2020, INFORMS J. Comput..

On a Polynomial Fractional Formulation for Independence Number of a Graph

Sergiy Butenko, Balabhaskar Balasundaram, 2006, J. Glob. Optim..

Graph Domination, Coloring and Cliques in Telecommunications

Sergiy Butenko, Balabhaskar Balasundaram, S. Butenko, 2006, Handbook of Optimization in Telecommunications.

Approaches for finding cohesive subgroups in large‐scale social networks via maximum k‐plex detection

Balabhaskar Balasundaram, Zhuqi Miao, Balabhaskar Balasundaram, 2017, Networks.

The Minimum Spanning k-Core Problem with Bounded CVaR Under Probabilistic Edge Failures

Balabhaskar Balasundaram, Juan Ma, Vladimir Boginski, 2016, INFORMS J. Comput..

Graph Theoretic Clique Relaxations and Applications

Balabhaskar Balasundaram, Foad Mahdavi Pajouh, Balabhaskar Balasundaram, 2013 .

Detecting large risk-averse 2-clubs in graphs with random edge failures

Balabhaskar Balasundaram, Foad Mahdavi Pajouh, Esmaeel Moradi, 2017, Ann. Oper. Res..

Graph theoretic generalizations of clique: optimization and extensions

Balabhaskar Balasundaram, Balabhaskar Balasundaram, 2009 .

RECOVERY ACT - Robust Optimization for Connectivity and Flows in Dynamic Complex Networks

Stan Uryasev, Sergiy Butenko, Balabhaskar Balasundaram, 2013 .

On the 2-Club Polytope of Graphs

Illya V. Hicks, Balabhaskar Balasundaram, Foad Mahdavi Pajouh, 2016, Oper. Res..

On inclusionwise maximal and maximum cardinality k-clubs in graphs

Balabhaskar Balasundaram, Foad Mahdavi Pajouh, Balabhaskar Balasundaram, 2012, Discret. Optim..

A branch-and-bound approach for maximum quasi-cliques

Balabhaskar Balasundaram, Foad Mahdavi Pajouh, Zhuqi Miao, 2014, Ann. Oper. Res..

On characterization of maximal independent sets via quadratic optimization

Oleg A. Prokopyev, Balabhaskar Balasundaram, Foad Mahdavi Pajouh, 2013, J. Heuristics.

Correction to: Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts

Balabhaskar Balasundaram, Yajun Lu, Esmaeel Moradi, 2018, Optim. Lett..

Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes

Balabhaskar Balasundaram, Svyatoslav Trukhanov, Shyam S. Chandramouli, 2010, Optim. Lett..

Topology design for on-demand dual-path routing in wireless networks

Marco Carvalho, Balabhaskar Balasundaram, Alexey Sorokin, 2013, Optim. Lett..

On the chance-constrained minimum spanning k-core problem

Balabhaskar Balasundaram, Juan Ma, Balabhaskar Balasundaram, 2018, J. Glob. Optim..

An exact algorithm for the maximum probabilistic clique problem

Eduardo L. Pasiliao, Balabhaskar Balasundaram, Zhuqi Miao, 2014, Journal of Combinatorial Optimization.

A Specialty Steel Bar Company Uses Analytics to Determine Available-to-Promise Dates

Ramesh Sharda, Balabhaskar Balasundaram, Tieming Liu, 2013, Interfaces.

Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts

Balabhaskar Balasundaram, Esmaeel Moradi, 2018, Optim. Lett..

Novel Approaches for Analyzing Biological Networks

Sergiy Butenko, Balabhaskar Balasundaram, Svyatoslav Trukhanov, 2005, J. Comb. Optim..

Detecting a most closeness-central clique in complex networks

Balabhaskar Balasundaram, Farzaneh Nasirian, Foad Mahdavi Pajouh, 2020, Eur. J. Oper. Res..

Optimization Problems in Unit-Disk Graphs

Sergiy Butenko, Balabhaskar Balasundaram, S. Butenko, 2009, Encyclopedia of Optimization.

Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem

Sergiy Butenko, Illya V. Hicks, Balabhaskar Balasundaram, 2011, Oper. Res..

Graph signatures: Identification and optimization

Balabhaskar Balasundaram, Juan S. Borrero, Hao Pan, 2021, Eur. J. Oper. Res..