Balasundaram, Balabhaskar "Baski" - School of Industrial Engineering and Management, Oklahoma State University

• IEM 3503 Engineering Economic Analysis (cross-listed as)
• Gradient-type Methods F. Mahdavi Pajouh
• ISEN 420: Operations Research I Sergiy Butenko
• IEM 5013 Introduction to Mathematical Programming Course Syllabus
• www.fico.com Make every decision countTM Xpress Optimization Suite
• Clique Relaxations in Social Network Analysis: The Maximum k-plex Problem
• On characterization of maximal independent sets via quadratic optimization
• IEM 5990 Network Flows and Combinatorial Optimization Course Syllabus
• www.fico.com Make every decision countTM Xpress Optimization Suite
• Graph Domination, Coloring and Cliques in Telecommunications
• Useful Results Farkas Lemma. Exactly one of the alternate systems has a solution.
• Variable Objective Search Sergiy Butenko
• Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
• Constructing Test Functions for Global Optimization Using Continuous
• OPTIMIZATION PROBLEMS IN UNIT-DISK B. Balasundaram
• Network Clustering Balabhaskar Balasundaram, Sergiy Butenko
• IEM 5033 Linear Optimization Spring 2011
• IEM 5033 Linear Optimization Implement in Matlab, the revised version of the simplex method discussed in your
• An Introduction to MATLAB S. Butenko, P. Pardalos, L. Pitsoulis
• IEM 5043 Nonlinear Optimization Spring 2011
• IEM 6023 Integer Programming Course Syllabus
• IEM 3503 Engineering Economic Analysis (cross-listed as)
• Clique Relaxations in Social Network Analysis: The Maximum k-plex Problem
• IEM 5033 Linear Optimization Practice Problems 02
• IEM 5013: Linear Modeling Class Problems-01: Formulation Problems
• Novel Approaches for Analyzing Biological Networks
• On inclusionwise maximal and maximum cardinality k-clubs in graphs
• On a Polynomial Fractional Formulation for Independence Number of a Graph
• Applications of optimization with Xpress-MP
• Annals of Operations Research manuscript No. (will be inserted by the editor)
• IEM 5013 Introduction to Mathematical Programming Course Syllabus
• IEM 4013 Linear Modeling Course Syllabus
• On inclusionwise maximal and maximum cardinality k-clubs in graphs
• IEM 4013 Linear Modeling Team Project 1
• IEM 5013: Introduction to Mathematical Programming Team Project 1
• IEM 5013: Introduction to Mathematical Programming Team Project 2
• IEM 6013 Network Flows and Combinatorial Optimization Spring 2012
• On inclusionwise maximal and maximum cardinality k-clubs in graphs
• IEM 5043 Nonlinear Optimization Spring 2012
• IEM 6990 Stochastic Optimization Spring 2012
• WE ARE VERY CONCERNED ABOUT YOUR SUCCESS AS A STUDENT AT OSU. THIS INFORMATION IS PROVIDED TO ANSWER QUESTIONS MOST OFTEN ASKED BY STUDENTS.
• Optimization Letters manuscript No. (will be inserted by the editor)