Balabhaskar Balasundaram

Curriculum Vitae
322 Engineering North Phone: (405) 744-6055
Industrial Engineering & Management Fax: (405) 744-4654
Oklahoma State University E-mail: baski@okstate.edu
Stillwater, OK 74078 URL: http://iem.okstate.edu/baski/

AFFILIATION

2007 - Present Oklahoma State University

Assistant Professor of Industrial Engineering & Management

EDUCATION

2002 - 2007 Doctor of Philosophy, Industrial Engineering

Texas A&M University, College Station, USA

1998 - 2002 Bachelor of Technology, Mechanical Engineering

Indian Institute of Technology - Madras
Chennai, India

RESEARCH INTERESTS

⋄ Mathematical optimization; Optimization under uncertainty; Optimization problems

in complex networks; Graph-based data mining of social and biological networks.

PUBLICATIONS1
R EFEREED J OURNAL A RTICLES

⋄ F. Mahdavi Pajouh and B. Balasundaram. Branch-and-cut approaches for the maxi-

mum 2-club problem. In preparation.

⋄ F. Mahdavi Pajouh, B. Balasundaram and V. Boginski. CVaR constrained minimum

spanning k-core problem for robust network design. In preparation.

⋄ F. Mahdavi Pajouh and B. Balasundaram. A variable neighborhood search heuristic

for k-clubs in graphs. In preparation.

⋄ S. Trukhanov, B. Balasundaram and S. Butenko. Generalization of Östergård’s algo-

rithm and an application to the maximum weight k-plex problem. In preparation.

⋄ F. Mahdavi Pajouh, B. Balasundaram and O. Prokopyev. On characterization of max-

imal independent sets via quadratic optimization. Submitted to Journal of Heuris-
tics.

⋄ S. Butenko, O. Yezerska and B. Balasundaram. Variable objective search. Submitted

to Journal of Heuristics.
1
Advisee names are underlined.

1
Curriculum Vitae Balabhaskar Balasundaram September 1, 2010

⋄ F. Mahdavi Pajouh and B. Balasundaram. On inclusionwise maximal and maximum

cardinality k-clubs in graphs. Submitted to Discrete Optimization.

⋄ B. Balasundaram, S. Butenko, and I. V. Hicks. Clique relaxations in social network

analysis: The maximum k-plex problem. To appear in Operations Research.

⋄ 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.

⋄ B. Balasundaram and S. Butenko. On a polynomial fractional formulation for inde-

pendence number of a graph. Journal of Global Optimization, 35(3):405–421, 2006.

⋄ B. Balasundaram, S. Butenko and S. Trukhanov. Novel approaches for analyzing

biological networks. Journal of Combinatorial Optimization, 10(1):23–39, 2005.

⋄ 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.

R EFEREED B OOK C HAPTERS

⋄ B. Balasundaram and F. Mahdavi Pajouh. Graph theoretic clique relaxations and ap-
plications. To Appear In: P. M. Pardalos, D-Z. Du, and R. Graham (Eds) Handbook of
Combinatorial Optimization, 2nd Editions. Springer, 2012.

⋄ F. Mahdavi Pajouh and B. Balasundaram. Gradient-type methods. To Appear In: J. J.

Cochran (Ed) Encyclopedia of Operations Research and Management Science, Wiley, 2010.

⋄ 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.

⋄ B. Balasundaram and S. Butenko. Network clustering. In: B. H. Junker and F.

Schreiber (Eds) Analysis of Biological Networks, pages 113–138. Wiley, 2008.

⋄ B. Balasundaram and S. Butenko. Graph domination, coloring and cliques in telecom-

munications. In: M. G. C. Resende and P. M. Pardalos (Eds) Handbook of Optimization
in Telecommunications, pages 865–890. Springer, 2006.

R EFEREED C ONFERENCE P ROCEEDINGS

⋄ 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), pages 32–37.

⋄ B. Balasundaram. Cohesive subgroup model for graph-based text mining. In: Pro-
ceedings of the 2008 IEEE Conference on Automation Science and Engineering (CASE
2008), pages 989–994.

2
Curriculum Vitae Balabhaskar Balasundaram September 1, 2010

⋄ G. Srinivasan, B. Balasundaram and V. Karthik. Minimizing squared deviation of

completion times about a common due date - algorithms and heuristics. In: P. Rad-
hakrishnan, S. Palaniswami, P. V. Mohanram and J. Kanchana (Eds) Proceedings of the
Ist International Conference on Logistics and Supply Chain Management, PSG College of
Technology, India, 6–8th Aug, 2001, pages 234–239. Allied Publishers, 2001.
GRANTS
⋄ Oklahoma Laboratory for Advanced Research, Education, and Outreach in Transportation
and Logistics, PI: Ingalls, co-PIs: Kamath, Balasundaram, Liu, 9/1/2010–8/31/2011,
$130,000. Sponsor: Subcontracted from University of Oklahoma for Oklahoma Transporta-
tion Center

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

⋄ A Design Optimization Tool for Supply Chains (DOTS), PI: Ingalls, co-PIs: Kamath, Bal-
asundaram, 6/1/2010–5/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–12/31/2010,

$26,003. Sponsor: Entero Technologies LLC., Center for Engineering Logistics and Distri-
bution (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–6/30/2011, $107,711. Sponsor: Webco Industries
Inc.

⋄ Robust Optimization for Connectivity and Flows in Dynamic Complex Networks, PI: Bala-
sundaram, 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–6/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, $40,000. Sponsor: Center for
Engineering Logistics and Distribution (National Science Foundation I/UCRC)
AWARDS
⋄ Recipient (2nd place), Pritsker Doctoral Dissertation Award, Institute of Industrial En-
gineers, May 2008
Citation: “ The Pritsker Doctoral Dissertation Award is a memorial endowment
in the name of A. Alan B. Pritsker that recognizes outstanding doctoral dissertation
research in industrial engineering.”

⋄ Recipient, George Kunze Prize, Texas A&M University, April 2007

Citation: “ The Kunze Prize is presented to a doctoral student nearing comple-
tion of the degree program. The primary basis for nomination and selection shall be

3
Curriculum Vitae Balabhaskar Balasundaram September 1, 2010

superior academic achievement and one or more publications in a refereed journal

of national or international stature. Secondly, the nominee shall have demonstrated
good citizenship through contributions to the university and/or community.”

⋄ Recipient, U.S. Senator Phil Gramm Doctoral Fellowship, Texas A&M University, April
2007
Citation: “This fellowship, available only to currently enrolled doctoral students
at Texas A&M University, recognizes scholarly excellence. Named after the former
Senator and A&M Economics Professor, the Fellowship encourages and rewards out-
standing teaching and research by doctoral students whose command of their respec-
tive disciplines exemplifies the meaning of scholar/mentor in the highest sense.”

⋄ Recipient, Distinguished Graduate Student Award for Excellence in Teaching awarded by

the Association of Former Students of Texas A&M University, March 2007
Citation: “This award is presented in recognition of academic achievement, pro-
fessional dedication, and outstanding contributions in teaching at Texas A&M Uni-
versity.”

⋄ Nominee, Distinguished Graduate Student Award for Excellence in Research awarded by

the Association of Former Students of Texas A&M University, March 2006

⋄ Recipient, Graduate Student Research and Presentation Grant funded by the Association
of Former Students and the Office of Graduate Studies of Texas A&M University, Sep
2005

⋄ Recipient, Best Poster Award for “Constructing test functions for global optimization
using continuous formulations of optimization problems on graphs” in the Workshop
on Multiscale Optimization Methods and Applications, Feb 26-28, 2004, University of
Florida, Gainesville, FL

⋄ Recipient, Best Paper Award for “A backtracking heuristic for solving U-shaped as-
sembly line balancing problem” in Shaastra TechFest 2002, Paper presentation compe-
tition, Indian Institute of Technology - Madras, India. (With P. Devarajan)

CONFERENCE PRESENTATIONS

⋄ Conditional Value-at-Risk Based Approaches to Robust Network Flow, Connectivity

and Design Problems. 2010 DOE Applied Mathematics Program Meeting, May 3–5,
2010, Berkeley, CA (Poster presentation)

⋄ Data Reduction by Generalized Graph Domination. Spring 2010 CELDi Meeting,

April 6–7, 2010, Atlanta, GA (Poster presentation)

⋄ Minimum spanning k-core problem for robust network design. 2010 INFORMS Op-
timization Society Meeting, Feb 26–28, 2010, University of Florida, Gainesville, FL

⋄ Degree-based relaxations of cliques, independent sets and coloring. International

Conference on the Dynamics of Information Systems (DIS) 2010, February 3–5, 2010,
Gainesville, FL

4
Curriculum Vitae Balabhaskar Balasundaram September 1, 2010

⋄ Models for clustering commodities into logistical families. International Conference

on Value Chain Sustainability (ICOVACS) 2009, Oct 19–21, 2009, Louisville, KY (Pre-
sented by K. Melton)

⋄ A computational study of the maximum k-club problem. INFORMS Annual Meeting

2009, Oct 11–14, 2009, San Diego, CA (Presented by coauthor F. Mahdavi Pajouh)

⋄ Algorithms for maximum k-plexes in power-law graphs. INFORMS Annual Meeting

2009, Oct 11–14, 2009, San Diego, CA

⋄ A novel model for system optimal freight flow assignment for the national highway
network. INFORMS Annual Meeting 2009, Oct 11–14, 2009, San Diego, CA (Pre-
sented by coauthor S. Srivathsan)

⋄ A combinatorial branch-and-bound for the maximum k-club problem. IERC 2009,

May 30–June 1, 2009, Miami, FL (Presented by coauthor F. Mahdavi Pajouh)

⋄ On the maximum 2-club problem. INFORMS Annual Meeting 2008, Oct 12–15, 2008,
Washington, DC

⋄ A fractional programming approach to determine the independence number of a

graph. INFORMS Annual Meeting 2008, Oct 12–15, 2008, Washington, DC (Pre-
sented by coauthor J. Desai)

⋄ Cohesive subgroup model for graph-based text mining. 2008 IEEE Conference on
Automation Science and Engineering, Aug 23–26, 2008, Washington, DC

⋄ Sum-of-affine-ratios fractional program for the independence number of a graph.

2008 INFORMS Optimization Society Meeting, March 14–16, 2008, Georgia Institute
of Technology, Atlanta, GA

⋄ Cohesive subgroups in biological networks. ABCS 2008 Workshop on Bioinformat-

ics, Computational Biology and Systems Biology, Feb 22–23, 2008, Texas A&M Uni-
versity, College Station, TX

⋄ Clique generalizations and clusters in biological networks. INFORMS Annual Meet-

ing 2007, Nov 4–7, 2007, Seattle, WA

⋄ Finding low diameter clusters in graphs. INFORMS Annual Meeting 2007, Nov 4–7,
2007, Seattle, WA

⋄ CombinaTexas Conference, Feb 24, 2007, Texas A&M University, College Station, TX

⋄ Generalization of cliques, independent sets and coloring. INFORMS Annual Meeting

Pittsburgh 2006, Nov 5–8, 2006, Pittsburgh, PA

⋄ Network-based approaches in data mining. INFORMS Annual Meeting 2006, Nov

5–8, 2006, Pittsburgh, PA (Presented by coauthor S. Trukhanov)

⋄ On continuous formulations of discrete optimization problems. INFORMS Annual

Meeting 2006, Nov 5–8, 2006, Pittsburgh, PA (Presented by coauthor S. Butenko)

5
Curriculum Vitae Balabhaskar Balasundaram September 1, 2010

⋄ Clique relaxation models of clusters in biological networks. DIMACS Workshop on

Clustering Problems in Biological Networks, May 9–11, 2006, Rutgers University,
Piscataway, NJ (Presented by coauthor S. Butenko)

⋄ CombinaTexas Conference on Graph-Theoretical Chemistry and Bioinformatics, Feb

24–25, 2006, Texas Southern University, Houston, TX

⋄ On connectivity properties of airline networks. INFORMS Annual Meeting 2005,

Nov 13–16, 2005, San Francisco, CA (Presented by coauthor S. Butenko)

⋄ Clique relaxations in social network analysis: The maximum k-plex Problem. IN-
FORMS Annual Meeting 2005, Nov 13–16, 2005, San Francisco, CA

⋄ Graph theoretic relaxations of clique models in social network analysis. Combina-

Texas Conference, Feb 25–26, 2005, Texas State University, San Marcos, TX

⋄ On continuous approaches to graph problems. INFORMS Annual Meeting 2004, Oct

24–27, 2004, Denver, CO

⋄ CombinaTexas Conference, Apr 9–10, 2004, Texas A&M University, College Station,
TX

⋄ Constructing test functions for global optimization using continuous formulations

of optimization problems on graphs Workshop on Multiscale Optimization Methods
and Applications, Feb 26–28, 2004, University of Florida, Gainesville, FL

STUDENTS ADVISED
D OCTORAL S TUDENTS A DVISED

⋄ Rakesh Prakash (Ph.D., in progress)

⋄ Foad Mahdavi Pajouh (Ph.D., in progress)

M ASTERS S TUDENTS A DVISED

⋄ Juliana Bright (M.S., in progress)

⋄ Ninad Joshi (M.S., in progress)

⋄ Pranav Dharmadhikari (M.S., in progress)

⋄ Vidyasagar Kodukula (M.S., in progress)

⋄ Amol Bhave (M.S., in progress)

⋄ Ameya Dhaygude (M.S., in progress)

⋄ Sameer Mangalvedhe (M.S., in progress)

⋄ Rahul Banda (M.S., Fall 2009), currently a Health Analyst for Health Integrity LLC

⋄ Krishna Chaitanya Gunturu (M.S., Summer 2009), currently a Supply Chain Engi-
neer with Ryder Supply Chain Solutions

6
Curriculum Vitae Balabhaskar Balasundaram September 1, 2010

U NDERGRADUATE S ENIOR D ESIGN T EAMS A DVISED

⋄ Marco Borunda, Nadia Brigita, Bailey Layman (Fall 2009, An Investigation of High
Patient Waiting Time at the Baptist Community Clinic)

⋄ Marcus Concienne, Mitchel McCowan, Doann Nguyen (Fall 2008, An Investigation

Into The Development Of A Method To Identify RFQ Similarity At Webco Industries, Inc.,
First Place, IIE South-Central Regional Student Paper Competition Feb 2009,
Third Place, IIE International Student Paper Competition, May 2009)
TEACHING
G RADUATE
IEM 5013 Introduction to Mathematical Programming
IEM 5033 Linear Optimization
IEM 5043 Nonlinear Optimization
IEM 6013 Network Flows and Combinatorial Optimization
IEM 6023 Integer Programming
U NDERGRADUATE
IEM 3503 Engineering Economic Analysis
IEM 4913 Senior Design Projects (Team Mentor)

PROFESSIONAL SERVICE
⋄ Session Chair,

◦ Optimization Methodology. 2009 Industrial Engineering Research Conference

(IERC), May 30–June 3, 2009, Miami, FL
◦ Internet Analytics and Automation. 2008 IEEE Conference on Automation Sci-
ence and Engineering, Aug 23–26, 2008, Washington, DC
◦ Discrete Optimization. 2008 INFORMS Southwest Regional Conference, April
18–19, 2008, Texas A&M University, College Station, TX

⋄ Advisory Committee Member,

◦ Yalta Conference on Network Science, Aug 2-4, 2010, Yalta, Ukraine

◦ Yalta Conference on Discrete and Global Optimization, July 31–August 2, 2008,
Yalta, Ukraine

⋄ Editorial board member of the Journal of Global Optimization

⋄ Reviewer,

◦ Journal of Combinatorial Optimization

◦ Journal of Global Optimization
◦ Optimization Letters
◦ Annals of Operations Research
◦ Discrete Optimization
◦ Journal of Heuristics

7
Curriculum Vitae Balabhaskar Balasundaram September 1, 2010

◦ Journal of Optimization Methods & Software

◦ Optimization and Engineering
◦ INFORMS Journal on Computing
◦ Asia-Pacific Journal of Operations Research
◦ Computers & Industrial Engineering
◦ IIE Transactions
◦ Journal of Communications & Networks
◦ Discrete Event Dynamic Systems: Theory and Applications
◦ IEEE Transactions on Automation Science and Engineering
◦ IEEE/ACM Transactions on Computational Biology and Bioinformatics

⋄ NSF panelist, Spring 2009, Fall 2009

⋄ Member,

◦ Institute for Operations Research and the Management Sciences (INFORMS)

◦ Institute of Industrial Engineers (IIE)
◦ Mathematical Optimization Society (MOS)
◦ Society for Industrial and Applied Mathematics (SIAM)
◦ American Mathematical Society (AMS)

⋄ Faculty Adviser, Student Chapter of IIE at Oklahoma State University, 2007–Present

⋄ Mentor, Oklahoma Louis Stokes Alliance for Minority Participation (OK-LSAMP),

2008-2009

PROFESSIONAL DEVELOPMENT

⋄ Participant, OSU Regents Professors Mentoring Program, Seminar by Regents Profes-

sors Bob Miller and John Bowen organized by OSU Institute for Teaching and Learn-
ing Excellence, Sep 12, 2007.

⋄ Participant, Finding and Winning Funding at NIH, Seminar Organized by Office of

Proposal Development, Texas A&M University, Feb 27, 2007.

⋄ Participant, How to Mentor Graduate Students, Seminar Organized by The Office of the
Dean of Faculties and Office of Proposal Development, Texas A&M University, Feb
21, 2007.

⋄ Participant, Competing for Funding at NSF, Seminar Organized by Office of Proposal

Development, Texas A&M University, Mar 22, 2006.

⋄ Participant, Future Academician Colloquium, INFORMS Combined Colloquia, New

Orleans/San Francisco 2005, Nov 11-12, 2005, San Francisco, California.