Balabhaskar Balasundaram

According to our database, Balabhaskar Balasundaram authored at least 32 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

First passage time interdiction in Markov chains.

Niloufar Daemi, Juan Sebastian Borrero, Balabhaskar Balasundaram

Oper. Res. Lett., 2024

2023

On atomic cliques in temporal graphs.

Yajun Lu, Zhuqi Miao, Parisa Sahraeian, Balabhaskar Balasundaram

Optim. Lett., May, 2023

2022

Interdicting Low-Diameter Cohesive Subgroups in Large-Scale Social Networks.

Niloufar Daemi, Juan Sebastian Borrero, Balabhaskar Balasundaram

INFORMS J. Optim., July, 2022

On Fault-Tolerant Low-Diameter Clusters in Graphs.

Yajun Lu, Hosseinali Salemi, Balabhaskar Balasundaram, Austin Buchanan

INFORMS J. Comput., 2022

Graph signatures: Identification and optimization.

Balabhaskar Balasundaram, Juan Sebastian Borrero, Hao Pan

Eur. J. Oper. Res., 2022

A Decomposition Branch-and-Cut Algorithm for the Maximum Cross-Graph k-Club Problem.

Hao Pan, Balabhaskar Balasundaram, Juan Sebastian Borrero

Proceedings of the 10th International Network Optimization Conference, 2022

2021

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

Babak Farmanesh, Arash Pourhabib, Balabhaskar Balasundaram, Austin Buchanan

IISE Trans., 2021

2020

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

Zhuqi Miao, Balabhaskar Balasundaram

INFORMS J. Comput., 2020

Detecting a most closeness-central clique in complex networks.

Farzaneh Nasirian, Foad Mahdavi Pajouh, Balabhaskar Balasundaram

Eur. J. Oper. Res., 2020

2019

On the chance-constrained minimum spanning k-core problem.

Juan Ma, Balabhaskar Balasundaram

J. Glob. Optim., 2019

2018

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

Esmaeel Moradi, Balabhaskar Balasundaram

Optim. Lett., 2018

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

Yajun Lu, Esmaeel Moradi, Balabhaskar Balasundaram

Optim. Lett., 2018

2017

Approaches for finding cohesive subgroups in large-scale social networks via maximum <i>k</i>-plex detection.

Zhuqi Miao, Balabhaskar Balasundaram

Networks, 2017

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

Foad Mahdavi Pajouh, Esmaeel Moradi, Balabhaskar Balasundaram

Ann. Oper. Res., 2017

2016

On the 2-Club Polytope of Graphs.

Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Illya V. Hicks

Oper. Res., 2016

The Minimum Spanning <i>k</i>-Core Problem with Bounded CVaR Under Probabilistic Edge Failures.

Juan Ma, Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Vladimir Boginski

INFORMS J. Comput., 2016

2014

An exact algorithm for the maximum probabilistic clique problem.

Zhuqi Miao, Balabhaskar Balasundaram, Eduardo L. Pasiliao

J. Comb. Optim., 2014

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

Foad Mahdavi Pajouh, Zhuqi Miao, Balabhaskar Balasundaram

Ann. Oper. Res., 2014

2013

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

Marco Carvalho, Alexey Sorokin, Vladimir Boginski, Balabhaskar Balasundaram

Optim. Lett., 2013

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

Foad Mahdavi Pajouh, Dahai Xing, Yingjue Zhou, Sharethram Hariharan, Balabhaskar Balasundaram, Tieming Liu, Ramesh Sharda

Interfaces, 2013

On characterization of maximal independent sets via quadratic optimization.

Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Oleg A. Prokopyev

J. Heuristics, 2013

Variable objective search.

Sergiy Butenko, Oleksandra Yezerska, Balabhaskar Balasundaram

J. Heuristics, 2013

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

Svyatoslav Trukhanov, Chitra Balasubramaniam, Balabhaskar Balasundaram, Sergiy Butenko

Comput. Optim. Appl., 2013

2012

On inclusionwise maximal and maximum cardinality k-clubs in graphs.

Foad Mahdavi Pajouh, Balabhaskar Balasundaram

Discret. Optim., 2012

2011

Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem.

Balabhaskar Balasundaram, Sergiy Butenko, Illya V. Hicks

Oper. Res., 2011

2010

Approximation algorithms for finding and partitioning unit-disk graphs into co-<i>k</i>-plexes.

Balabhaskar Balasundaram, Shyam Sundar Chandramouli, Svyatoslav Trukhanov

Optim. Lett., 2010

2009

Optimization Problems in Unit-Disk Graphs.

Balabhaskar Balasundaram, Sergiy Butenko

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Graph theoretic generalizations of clique: optimization and extensions.

Balabhaskar Balasundaram

PhD thesis, 2009

2006

On a Polynomial Fractional Formulation for Independence Number of a Graph.

Balabhaskar Balasundaram, Sergiy Butenko

J. Glob. Optim., 2006

Graph Domination, Coloring and Cliques in Telecommunications.

Balabhaskar Balasundaram, Sergiy Butenko

Proceedings of the Handbook of Optimization in Telecommunications, 2006

2005

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

Balabhaskar Balasundaram, Sergiy Butenko

Optim. Methods Softw., 2005

Novel Approaches for Analyzing Biological Networks.

Balabhaskar Balasundaram, Sergiy Butenko, Svyatoslav Trukhanov

J. Comb. Optim., 2005