Skip to main content
OKState.edu
Current StudentsFaculty/StaffmyOKSTATEDirectory
Quicklinks
/
Search
 Apply
Close
Search
DirectoryA-Z Site Index
Quicklinks
Logins
myOKSTATEEmailO-Key AccountCanvas
Academic Schedule
Academic CalendarCatalogClass ScheduleRegistrar
Places & Departments
BookstoreBursarIT HelpdeskLibraryParking & TransitStudent Union
Trending Now
OSU CalendarCampus Map
Go back to top of page

College of
Engineering, Architecture and Technology

Open Main MenuClose Main Menu
About the College Schools & Programs Research Engineering Extension Facilities
Info for
About the College Schools & Programs Research Engineering Extension Facilities
Info for
Current StudentsFaculty/StaffmyOKSTATEDirectory
Search
DirectoryA-Z Site Index
Quicklinks
Logins
myOKSTATEEmailO-Key AccountCanvas
Academic Schedule
Academic CalendarCatalogClass ScheduleRegistrar
Places & Departments
BookstoreBursarIT HelpdeskLibraryParking & TransitStudent Union
Trending Now
OSU CalendarCampus Map
Go back to top of page

Publications

Journal Articles

  • F. Nasirian, F. Mahdavi Pajouh, and B. Balasundaram. Detecting a most closeness-central clique in complex networks. European Journal of Operational Research, 283(2):461–475, June 2020. (link)
  • B. Farmanesh, A. Pourhabib, B. Balasundaram, and A. Buchanan. A Bayesian framework for functional calibration of expensive computational models through non-isometric matching. IISE Transactions, DOI 10.1080/24725854.2020.1774688, May 2020. (link) (arXiv)
  • Z. Miao and B. Balasundaram. An ellipsoidal bounding scheme for the quasi-clique number of a graph. INFORMS Journal on Computing, DOI 10.1287/ijoc.2019.0922, February 2020. (link)
  • J. Ma and B. Balasundaram. On the chance-constrained minimum spanning k-core problem. Journal of Global Optimization, 74(4):783–801, 2019. (link)
  • S. Sun, Z. Miao, B. Ratcliffe, P. Campbell, B. Pasch, Y. El-Kassaby, B. Balasundaram, and C. Chen. SNP variable selection by generalized graph domination. PLoS ONE, January 2019. (link)
  • E. Moradi and B. Balasundaram. Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts. Optimization Letters, 12(8):1947–1957, 2018 (link) See also: Y. Lu, E. Moradi, and B. Balasundaram. Correction to: Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts. Optimization Letters, 12(8):1959–1969, 2018. (link)
  • Z. Miao and B. Balasundaram. Approaches for finding cohesive subgroups in large-scale social networks via maximum k-plex detection. Networks, 69(4):388–407, 2017. (link)
  • F. Mahdavi Pajouh, E. Moradi, and B. Balasundaram. Detecting large risk-averse 2-clubs in graphs with random edge failures. Annals of Operations Research, 249(1):55–73, 2017. (link)
  • F. Mahdavi Pajouh, B. Balasundaram, and I. V. Hicks. On the 2-club polytope of graphs. Operations Research, 64(6):1466–1481, 2016. (link)
  • J. Ma, F. Mahdavi Pajouh, B. Balasundaram, and V. Boginski. The minimum spanning k-core problem with bounded CVaR under probabilistic edge failures. INFORMS Journal on Computing, 28(2):295–307, 2016. (link)
  • F. Mahdavi Pajouh, Z. Miao, and B. Balasundaram. A branch-and-bound approach for maximum quasi-cliques. Annals of Operations Research, 216(1):145–161, 2014. (link)
  • Z. Miao, B. Balasundaram and E. L. Pasiliao. An exact algorithm for the maximum probabilistic clique problem. Journal of Combinatorial Optimization, 28(1):105–120, 2014. (link)
  • F. Mahdavi Pajouh, D. Xing, Y. Zhou, S. Hariharan, B. Balasundaram, T. Liu, and R. Sharda. A specialty steel bar company uses analytics to determine available-to-promise dates. Interfaces, 43(6):503–517, 2013. (link)
  • S. Trukhanov, C. Balasubramaniam, B. Balasundaram, and S. Butenko. Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations. Computational Optimization and Applications, 56(1):113–130, 2013. (link)
  • F. Mahdavi Pajouh, B. Balasundaram, and  O. Prokopyev. On characterization of maximal independent sets via quadratic optimization. Journal of Heuristics, Special Issue on Unconstrained Quadratic Binary Optimization, 19(4):629–644, 2013. (link)
  • S. Butenko, O. Yezerska, and B. Balasundaram. Variable objective search. Journal of Heuristics, Special Issue on Unconstrained Quadratic Binary Optimization, 19(4):697–709, 2013. (link)
  • M. Carvalho, A. Sorokin, V. Boginski, and B. Balasundaram. Topology Design for On-Demand Dual-Path Routing in Wireless Networks. Optimization Letters, Special Issue on Dynamics of Information Systems, 7(4):695–707, 2013. (link)
  • F. Mahdavi Pajouh and B. Balasundaram. On inclusionwise maximal and maximum cardinality k-clubs in graphs. Discrete Optimization, 9(2):84–97, 2012. (link)
  • T. Grout, Y. Hong, J. Basara, B. Balasundaram, Z. Kong. and S. T. S. Bukkapatnam. Significant Winter Weather Events and Associated Socioeconomic Impacts (Federal Aid Expenditures) across Oklahoma: 2000-2010. Weather, Climate, and Society, 4(1):48–58, 2012. (link)
  • B. Balasundaram, S. Butenko, and I. V. Hicks. Clique relaxations in social network analysis: The maximum k-plex problem. Operations Research, 59(1):133–142, 2011. (link)
  • B. Balasundaram, S. S. Chandramouli, and S. Trukhanov. Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes. Optimization Letters, 4(3):311–320, 2010. (link)
  • B. Balasundaram and S. Butenko. On a polynomial fractional formulation for independence number of a graph. Journal of Global Optimization, 35(3):405–421, 2006. (link)
  • B. Balasundaram, S. Butenko and S. Trukhanov. Novel approaches for analyzing biological networks. Journal of Combinatorial Optimization, 10(1):23–39, 2005. (link)
  • B. Balasundaram and S. Butenko. Constructing test functions for global optimization using continuous formulations of graph problems. Journal of Optimization Methods and Software, 20(4-5):439–452, 2005. (link)

 

Book Chapters

  • B. Balasundaram and F. Mahdavi Pajouh. Graph-theoretic clique relaxations and applications. In: P. Pardalos, D-Z. Du and R. Graham (Eds) Handbook of Combinatorial Optimization, 2nd Edition, pages 1559–1598. Springer, 2013. (link)
  • F. Mahdavi Pajouh and B. Balasundaram. Gradient-type methods. In: J. J. Cochran et al. (Eds) Encyclopedia of Operations Research and Management Science. Wiley, 2011. (link)
  • B. Balasundaram and S. Butenko. Optimization problems in unit-disk graphs. In: C. A. Floudas and P. M. Pardalos (Eds) Encyclopedia of Optimization, 2nd Edition, pages 2832–2844. Springer, 2009. (link)
  • B. Balasundaram and S. Butenko. Network clustering. In: B. H. Junker and F. Schreiber (Eds) Analysis of Biological Networks, pages 113–138. Wiley, 2008. (link)
  • B. Balasundaram and S. Butenko. Graph domination, coloring and cliques in telecommunications. In: M. G. C. Resende and P. M. Pardalos (Eds) Handbook of Optimization in Telecommunications, pages 865–890. Springer, 2006. (link)

 

Conference Precedings

  • J. Ma and B. Balasundaram. Solving chance-constrained spanning k-core problem via decomposition and integer programming. In: Proceedings of the 2013 Industrial and Systems Engineering Research Conference (ISERC 2013). (link)
  • Z. Miao and B. Balasundaram. Cluster detection in large-scale social networks using k-plexes. In: Proceedings of the 2012 Industrial and Systems Engineering Research Conference (ISERC 2012). (link)
  • P. Sittivijan, M. Kamath, and B. Balasundaram. Models for clustering commodities into logistical families. In: Proceedings of the 2009 International Conference on Value Chain Sustainability (ICOVACS 2009).
  • B. Balasundaram. Cohesive subgroup model for graph-based text mining. In: Proceedings of the 2008 IEEE Conference on Automation Science and Engineering, pages 989–994.(link)
  • G. Srinivasan, B. Balasundaram and V. Karthik. Minimizing squared deviation of completion times about a common due date- algorithms and heuristics. In: P. Radhakrishnan, S. Palaniswami, P.V. Mohanram and J. Kanchana (Eds) Proceedings of the First International Conference on Logistics and Supply Chain Management, pages 234–239. Allied Publishers, 2001. (link)

 

Dissertation

  • Graph Theoretic Generalizations of Clique: Optimization and Extensions. Texas A&M University, 2007. Committee: Drs. Sergiy Butenko (Chair), Illya V. Hicks, Wilbert E. Wilhelm, Catherine H. Yan (link)

 

*Please contact me via email for pre-publication manuscripts or visit my ResearchGate profile.

Back To Top
MENUCLOSE