Balabhaskar "Baski" Balasundaram

Baski Balasundaram, Ph.D.
Assistant Professor
School of Industrial Engineering & Management
Oklahoma State University 
322 Engineering North 
Stillwater, OK 74078
Phone: (405) 744-6055
Fax: (405) 744-4654
Email Me
View My Calendar
My OSU IEM Webpage
Curriculum Vitae (PDF) (PS)
  
  • Education

    • Ph.D, Industrial Engineering, Texas A&M University,  2007.

    • B.Tech, Mechanical Engineering, Indian Institute of Technology-Madras, India, 2002

  • Research Interests
    Optimization theory, algorithms, and applications in graph-based data mining, analytics, and complex networks.

  • Journal Publications

    • F. Mahdavi Pajouh, Z. Miao and B. Balasundaram. A branch-and-bound approach for maximum quasi-cliques. Accepted pending minor revisions, Annals of Operations Research. (PDF) (BibTeX)

    • 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, 2012, DOI 10.1007/s11590-012-0453-0. (PDF) (BibTeX) (link)

    • F. Mahdavi Pajouh and B. Balasundaram. On inclusionwise maximal and maximum cardinality k-clubs in graphs. Discrete Optimization, 2012, DOI 10.1016/j.disopt.2012.02.002. (PDF) (BibTeX) (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, 2011, DOI 10.1007/s10732-011-9171-5. (PDF) (BibTeX) (link)

    • S. Butenko, O. Yezerska, and B. Balasundaram. Variable objective search. Journal of Heuristics, 2011, DOI 10.1007/s10732-011-9174-2. (PDF) (BibTeX) (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. (PDF) (BibTeX) (old version) (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. (PDF) (BibTeX) (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. (PDF) (BibTeX) (link)

    • B. Balasundaram, S. Butenko and S. Trukhanov. Novel approaches for analyzing biological networks. Journal of Combinatorial Optimization, 10(1):23-39, 2005. (PDF) (BibTeX) (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. (PDF) (BibTeX) (link)

  • Book Chapters

    • B. Balasundaram and F. Mahdavi Pajouh. Graph-theoretic clique relaxations and applications. To appear In: P. Pardalos, D-Z. Du and R. Graham (Eds) Handbook of Combinatorial Optimization, 2nd Edition. Springer.(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. (PDF) (BibTeX)(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. (PDF) (BibTeX) (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. (PDF) (BibTeX) (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. (PDF) (BibTeX) (link)

  • Conference Proceedings

    • Z. Miao, and B. Balasundaram. Cluster detection in large-scale social networks using k-plexes. To Appear In: Proceedings of the 2012 Industrial and Systems Engineering Research Conference (ISERC 2012).

    • 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)

  • Honors & Awards

    • IIE South Central Region Outstanding Advisor Award, Institute of Industrial Engineers, May 2011.

    • IIE Pritsker Doctoral Dissertation Award (2nd place), May 2008.

    • George Kunze Prize, Texas A&M University, April 2007.

    • Phil Gramm Doctoral Fellowship, Texas A&M University, April 2007.

    • Distinguished Graduate Student Award for Excellence in Teaching, Texas A&M University, March 2007.

  • Grants & Projects

    • ECLIPSE: Environment for Contextualized Learning and Insightful Problem Solving Experiences, PI: Antonenko, co-PIs: Nichols, Gelder, Greenwood, Balasundaram, 9/1/2011--8/31/2012, $49,281. Sponsor: Oklahoma State University Planning Grants.

    • Developing Freight Transportation and Logistics Certificate Program
      for Oklahoma, PI: Kamath, co-PIs: Balasundaram, Ingalls, Liu, 10/1/2011--9/30/2012, $87,465. Sponsor: Oklahoma Transportation Center.

    • Oklahoma Center for Transportation and Logistics Research, Education, and Outreach, PI: Ingalls, co-PIs: Kamath, Balasundaram, Liu, 7/1/2011--8/31/2012, $150,000. Sponsor: Oklahoma Transportation Center.

    • Acquisition of LIDAR Laser Scanner for Bridge Inspection, PI: Kong, co-PIs: Ley, Emerson, Balasundaram, Collins, Liu, 8/1/2010--10/31/2011, $200,000. Sponsor: Oklahoma Transportation Center.

    • A Design Optimization Tool for Supply Chains (DOTS), PI: Ingalls, co-PIs: Kamath, Balasundaram, 6/1/2010--12/31/2011, $21,666. Sponsor: Center for Engineering Logistics and Distribution (National Science Foundation I/UCRC).

    • Data reduction by generalized graph domination, PI: Balasundaram, 2/1/2010–7/31/2010, $35,558. Sponsor: Entero Technologies LLC., Center for Engineering Logistics and Distribution (National Science Foundation I/UCRC).

    • Development of an available-to-promise decision support system for Webco industries, PI: Liu, co-PI: Balasundaram, 4/1/2010–12/31/2011, $107,711. Sponsor: Webco Industries Inc.

    • Robust Optimization for Connectivity and Flows in Dynamic Complex Networks, PI: Balasundaram, co-PIs: Boginski, Uryasev (University of Florida), Butenko (Texas A&M), 9/15/2009–9/14/2012, $589,092. Sponsor: Department of Energy.

    • Proactive Approach To Transportation Resource Allocation Under Severe Winter Weather Emergencies, PI: Balasundaram, co-PIs: Bukkapatnam, Kong, Hong (University of Oklahoma), 7/1/2009–9/30/2011, $261,194. Sponsor: Oklahoma Transportation Center.

    • Research Experiences for Teachers: Network Flow Models in Transportation and Logistics, PI: Kamath, co-PI: Balasundaram, 6/1/2008–7/31/2011, $50,000. Sponsor: Center for Engineering Logistics and Distribution (National Science Foundation I/UCRC).

  • Doctoral Students

    • Esmaeel Moradi (in progress)

    • Juan Ma (co-chair, in progress)

    • Foad Mahdavi Pajouh (in progress)

  • Masters Students

    • Zhuqi Miao (in progress)

    • Juliana Bright (Fall 2011), Thesis: Robust shortest paths under uncertainty using conditional value-at-risk, currently a Ph.D student at University of Arkansas

    • Ninad Joshi (Summer 2011), currently a business analyst with Sears Holding Corp.

    • Pranav Dharmadhikari (Summer 2011)

    • Vidyasagar Kodukula (Summer 2011)

    • Amol Bhave (Fall 2010), Thesis: Greedy randomized adaptive search procedure for the maximum co-k-plex problem, currently an applications developer with Cigniti, Inc

    • Ameya Dhaygude (Fall 2010), Thesis: A heuristic approach to the chance constrained minimum spanning k-core problem, currently an advanced analytics modeler with Dow Chemicals

    • Sameer Mangalvedhe (Fall 2010), Thesis: Greedy randomized adaptive search procedure for the maximum 2-club problem, currently a supply chain coordinator with RECARO Aircraft Seating Americas, Inc.

    • Rahul Banda (Fall 2009), currently a data analyst with AdvanceMed Corp.

    • Krishna Chaitanya Gunturu (Summer 2009), currently a supply chain engineer with Ryder Supply Chain Solutions

    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 (PDF) (BibTeX) (link)

  • Teaching
 

***All PDF files available here are pre-publication manuscripts. Visit the publisher's website to obtain these publications.