Dr. Tiru Arthanari

Department of Information Systems and Operations Management

Associate Professor

Email: t.arthanari@auckland.ac.nz

Qualifications

1976 Ph.D., Indian Statistical Institute, India

1967 M.Stat., Indian Statistical Institute, India

1965 B.Sc., University of Madras, India

Publications (Selected)

1. Ku, D., & Arthanari, T. (2014). On double cycling for container port productivity improvement. Annals of Operations Research, 1-16. doi: 10.1007/s10479-014-1645-z
2. Arthanari, T. S. (2013). Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope. Discrete Optimization, 10 (3), 224-232. doi:10.1016/j.disopt.2013.07.001
3. Arthanari, T. S. (2013). On Pedigree Polytope and its Properties. AAPP | Atti della Accademia Peloritana dei Pericolanti, 91 (2, A3), 1-24. doi:10.1478/AAPP.91S2A3
4. Arthanari, T. S., & Ardekani, L. H. (2013). A Multi-flow Necessary Condition for Membership in Pedigree Polytope - A Counter Example, ACIIDS 2, volume 7803 of Lecture Notes in Computer Science, page 409-419. Springer, ISBN: 978-3-642-36542-3
5. Arthanari, T. S., Babu, S., Krishnamurthy, N., (2012). Stochastic Game Model for the consignment assignment problem, Chapter 5 in Advances and Applications of Game Theory, edited by Mishra, R.K., Deman, S., Salunke, M., Rao, S. B., and Raveendran, J. Macmillan Publications, India, New Delhi, 2012.
6. Vardhan, R.V., Sukanya, J.V., and Arthanari, T.S., (2012). Criteria of Classification and Measures of Performance, International Journal of Advance Mathematics and Mathematical Sciences (Open Access Journal), Vol. 1, No. 1, January-June, 2012, Pp. 41-48.
7. Arthanari, T.S., Le Thi Hoai An, New formulations of the multiple sequence alignment problem, Optimization Letters, 5, 27–40, Springer, 2011, DOI 10.1007/s11590-010-0188-8.
8. Arthanari, T. S., Manna, D. K., and Biswas, A. K., Silo sizing and mixing to improve outgoing quality of fertilizer, OPSEARCH, 47, 1, 35–49, Springer, 2010.
9. Arthanari, T.S., Models Without Main Players, Chapter 7 in Modeling, Computation and Optimization, edited by Neogy, S.K., Das, A.K., and Bapat, R.B., Statistical Science and Interdisciplinary research, vol. 6, 97-114, World Scientific, May, 2009.
10. Haerian Ardekani, L., and Arthanari, T. S., Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration, in Modelling, Computation and Optimization in Information Systems and Management Sciences, Le Thi H. A., Bouvry, P., and Pham Dinh,T. (eds.), Springer, 2008.
11. Arthanari, T.S., On the Membership Problem of Pedigree Polytope, Chapter 6 in Mathematical Programming and Game Theory for Decision Making edited by S. K. Neogy, R. Bapat, B., Das, A. K. and Parthasarathy, T., Statistical Science and Interdisciplinary research, vol. 1, 61-98, World Scientific, May, 2008.
12. Arthanari, T.S., On Pedigree Polytopes and Hamiltonian Cycles, Discrete Mathematics, 306, 1474-1492, 2006.
13. Arthanari, T.S., Making Decisions within the Space of Seven Breaths, In Sylnovie Merchant (ed.), Proceedings of 4th Global Conference on Business & Economics, Oxford, UK, June 26- 28, 1-18, 2005.
14. Arthanari, T.S., Pedigree polytope is a Combinatorial Polytope, Chapter 1 in Operations Research with Economic and Industrial Applications: Emerging Trends, Eds. S.R. Mohan and S.K. Neogy, :1-17, Anamaya Publishers, New Delhi, India, 2005.
15. Arthanari, T.S., A Game Theory Application in Robust Design, Quality Engineering, Vol. 17,2, 291-300, 2005.
16. Arthanari, Tiru and Trietsch, Dan., A Graphical Method for the Pursuit of Optimal or Near Optimal Stochastic Balance, Proceedings of the 9th International Conference on Industrial Engineering--Theory, Applications and Practice, The University of Auckland, November 27- 30, 260-266, 2004.
17. Arthanari, T.S., Is Learning an Optimisation Problem, Proceedings of the 53rd Session of the International Statistical Institute, Seoul, 2001.
18. Arthanari, T.S. and Usha, M., On the Equivalence of the Multistage - Insertion and Cycle - Shrink Formulations of the Symmetric Travelling salesman Problem, Operations Research Letters, 29, 3, 129-139, 2001.
19. Arthanari, T.S. and Kecman, V., Comparisons of QP and LP Based Learning from Empirical Data, (in Engineering of Intelligent Systems, L. Monostori, J. Váncza, M. Ali (eds.), Proceedings of 14th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 2001, Budapest, Hungary), Springer Verlag, LNAI 2070, pp. 326-332, 2001.
20. Arthanari, T.S., Kecman, V. and Hadzic, I., LP and QP Based Learning From Empirical Data, IEEE Proceedings of IJCNN 2001, Vol 4., pp., 2451-2455, Washington, DC, 2001.
21. Arthanari, T.S. and Usha, M., An Alternate Formulation of the Symmetric Travelling Salesman Problem and its Properties, Discrete Applied Mathematics, 98, 173-190, 2000.
22. Arthanari, T.S., Rajendra Prasad, V. and Manna, D.K, A Note on Lower Bound for Completion Time Variance in Single Machine Scheduling, OPSEARCH, 34, 4, 1997.
23. Arthanari, T.S. and Chakraborty, A. K., Optimum Testing Time for Software under an Exploration Model, OPSEARCH, Vol. 31, 3, September 1994.
24. Arthanari, T.S. and Dodge, Y., Mathematical Programming in Statistics, Classics Library Series ,John Wiley and Sons, New York , 413 pages,1993.
25. Arthanari, T.S., Design and Analysis of Circuits and Networks – The Role of Mathematical Concepts - in Quality through Engineering Design, Edited by Kuo, W., Elsevier, Amsterdam, 1993.

Profile Details

http://www.james-madison.edu/faculty/jsmith