Balabhaskar Balasundaram

33 papers C 1Journal 29
YearRankTypeTitle / Venue / Authors
2024 J jnl
Finding conserved low-diameter subgraphs in social and biological networks.
Networks
Hao Pan, Yajun Lu, Balabhaskar Balasundaram, Juan Sebastian Borrero
2024 J jnl
First passage time interdiction in Markov chains.
Oper. Res. Lett.
Niloufar Daemi, Juan Sebastian Borrero, Balabhaskar Balasundaram
2023 J jnl
On atomic cliques in temporal graphs.
Optim. Lett.
Yajun Lu, Zhuqi Miao, Parisa Sahraeian, Balabhaskar Balasundaram
2022 C conf
A Decomposition Branch-and-Cut Algorithm for the Maximum Cross-Graph k-Club Problem.
INOC
Hao Pan, Balabhaskar Balasundaram, Juan Sebastian Borrero
2022 J jnl
Graph signatures: Identification and optimization.
Eur. J. Oper. Res.
Balabhaskar Balasundaram, Juan Sebastian Borrero, Hao Pan
2022 J jnl
Interdicting Low-Diameter Cohesive Subgroups in Large-Scale Social Networks.
INFORMS J. Optim.
Niloufar Daemi, Juan Sebastian Borrero, Balabhaskar Balasundaram
2022 J jnl
On Fault-Tolerant Low-Diameter Clusters in Graphs.
INFORMS J. Comput.
Yajun Lu, Hosseinali Salemi, Balabhaskar Balasundaram, Austin Buchanan
2021 J jnl
A Bayesian framework for functional calibration of expensive computational models through non-isometric matching.
IISE Trans.
Babak Farmanesh, Arash Pourhabib, Balabhaskar Balasundaram, Austin Buchanan
2020 J jnl
An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph.
INFORMS J. Comput.
Zhuqi Miao, Balabhaskar Balasundaram
2020 J jnl
Detecting a most closeness-central clique in complex networks.
Eur. J. Oper. Res.
Farzaneh Nasirian, Foad Mahdavi Pajouh, Balabhaskar Balasundaram
2019 J jnl
On the chance-constrained minimum spanning k-core problem.
J. Glob. Optim.
Juan Ma, Balabhaskar Balasundaram
2018 J jnl
Correction to: Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts.
Optim. Lett.
Yajun Lu, Esmaeel Moradi, Balabhaskar Balasundaram
2018 J jnl
Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts.
Optim. Lett.
Esmaeel Moradi, Balabhaskar Balasundaram
2017 J jnl
Approaches for finding cohesive subgroups in large-scale social networks via maximum
Networks
Zhuqi Miao, Balabhaskar Balasundaram
2017 J jnl
Detecting large risk-averse 2-clubs in graphs with random edge failures.
Ann. Oper. Res.
Foad Mahdavi Pajouh, Esmaeel Moradi, Balabhaskar Balasundaram
2016 J jnl
On the 2-Club Polytope of Graphs.
Oper. Res.
Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Illya V. Hicks
2016 J jnl
The Minimum Spanning
INFORMS J. Comput.
Juan Ma, Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Vladimir Boginski
2014 J jnl
A branch-and-bound approach for maximum quasi-cliques.
Ann. Oper. Res.
Foad Mahdavi Pajouh, Zhuqi Miao, Balabhaskar Balasundaram
2014 J jnl
An exact algorithm for the maximum probabilistic clique problem.
J. Comb. Optim.
Zhuqi Miao, Balabhaskar Balasundaram, Eduardo L. Pasiliao
2013 J jnl
A Specialty Steel Bar Company Uses Analytics to Determine Available-to-Promise Dates.
Interfaces
Foad Mahdavi Pajouh, Dahai Xing, Yingjue Zhou, Sharethram Hariharan, Balabhaskar Balasundaram, Tieming Liu, Ramesh Sharda
2013 J jnl
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations.
Comput. Optim. Appl.
Svyatoslav Trukhanov, Chitra Balasubramaniam, Balabhaskar Balasundaram, Sergiy Butenko
2013 J jnl
On characterization of maximal independent sets via quadratic optimization.
J. Heuristics
Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Oleg A. Prokopyev
2013 J jnl
Topology design for on-demand dual-path routing in wireless networks.
Optim. Lett.
Marco Carvalho, Alexey Sorokin, Vladimir Boginski, Balabhaskar Balasundaram
2013 J jnl
Variable objective search.
J. Heuristics
Sergiy Butenko, Oleksandra Yezerska, Balabhaskar Balasundaram
2012 J jnl
On inclusionwise maximal and maximum cardinality k-clubs in graphs.
Discret. Optim.
Foad Mahdavi Pajouh, Balabhaskar Balasundaram
2011 J jnl
Clique Relaxations in Social Network Analysis: The Maximum
Oper. Res.
Balabhaskar Balasundaram, Sergiy Butenko, Illya V. Hicks
2010 J jnl
Approximation algorithms for finding and partitioning unit-disk graphs into co-
Optim. Lett.
Balabhaskar Balasundaram, Shyam Sundar Chandramouli, Svyatoslav Trukhanov
2009 — —
Graph theoretic generalizations of clique: optimization and extensions.
Balabhaskar Balasundaram
2009 — ch.
Optimization Problems in Unit-Disk Graphs.
Encyclopedia of Optimization
Balabhaskar Balasundaram, Sergiy Butenko
2006 — ch.
Graph Domination, Coloring and Cliques in Telecommunications.
Handbook of Optimization in Telecommunications
Balabhaskar Balasundaram, Sergiy Butenko
2006 J jnl
On a Polynomial Fractional Formulation for Independence Number of a Graph.
J. Glob. Optim.
Balabhaskar Balasundaram, Sergiy Butenko
2005 J jnl
Constructing test functions for global optimization using continuous formulations of graph problems.
Optim. Methods Softw.
Balabhaskar Balasundaram, Sergiy Butenko
2005 J jnl
Novel Approaches for Analyzing Biological Networks.
J. Comb. Optim.
Balabhaskar Balasundaram, Sergiy Butenko, Svyatoslav Trukhanov