Prof. T. N. Badri has a B.A. in Mathematics, an MS in Computational Mathematics. He completed the Ph.D in Industrial Engineering. He has adapted well to working in Management Education. He teaches courses about the complexity of representation of data and also about the analysis of data such as decision trees, linear programming, queuing models, portfolio optimization, and computer simulation.

He is enjoying the administrative role of alumni affairs chairman. His latest thrill is swimming, although he has not given up on Sudoku.

His research interests are in developing and implementing algorithms for network design. His published work is as follows:

• Euclidean Steiner Minimal Trees, Minimum Energy Configurations, and the embedding problem of Weighted Graphs in Euclidean Space. Jointly authored with Prof. J. MacGregor Smith. Discrete Applied Mathematics Vol 71(1-3), pp. 187-215, Elsevier Science (1996)

• Properties of R-Sausages. Jointly authored with Prof. J. MacGregor Smith. Discrete and Computational Geometry, Vol 31(4), pp. 587-611, Springer Verlag (2004).

• A Sausage Heuristic for Steiner Minimal Trees in Three Dimensional Euclidean Space. Jointly authored with J. MacGregor Smith, Journal of Mathematical Modelling and Algorithms, Vol 4(2), pp. 199-217, Springer Science+Business Media, BV (2005)

• Regression Analysis of Capacity Utilization for Estimating Competitor’s Payoff Matrix in Two-Player, Non-Zero Sum Games, Jointly authored with Rajesh Ramakrishnan, from Wipro Technologies. ICFAI Journal of International Business. Vol. II, No. 2,  pp. 30-37, (2007).

• Simple Genetic Algorithm for Minimal Interconnecting Length after Delaunay Triangulation of Terminal Set. (work in process).

Download Heuristic 1.0