Krannert School of Management Purdue University 100 S. Grant West Lafayette, IN 47907-2076

Phone: (765) 496-2620 Fax: (765) 496-7434 Email: URL: web.ics.purdue.edu/~mtawarma

Education

Academic/Professional Appointments

Associate Professor, Purdue University, August 2006 - Present

Assistant Professor, Purdue University, August 2001 - August 2006

Software Engineer, ComputerVision, India, January 1995 - July 1995

Graduate Engineer, TELCO (Tata Engineering and Locomotive Company), India, July 1993 - December 1994

Research Interests

Mathematical Programming, Complexity and Approximation, Symbolic Computing. Research emphasis is on global optimization theory, algorithms and software. Applications and models in business, economics, systems, engineering design, and molecular design, are of particular interest.

Teaching Interests

Deterministic and Stochastic Operations Research, Mathematical Programming, Global Optimization, Convex Optimization, Applied Probability and Statistics, Quantitative Analysis, Spreadsheet Modeling and Decision Analysis, Optimization Models.

Book

Tawarmalani, M. and N. V. Sahinidis, Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software and Applications, 504 pages, Kluwer Academic Publishers, 2002.

Journal Publications

[1]

Bao, X., N. V. Sahinidis, and M. Tawarmalani, Semidefinite Relaxations for Quadratically Constrained Quadratic Programming: A Review with Comparisons, Mathematical Programming, 129, 129–157, 2011.

[2]

Tawarmalani, M. and Y. Li, Multi-period Network Maintenance Scheduling with Minimum Flow Disruption, Naval Research Logistics, 58, 507–530, 2011.

[3]

Tawarmalani, M. and J.-P. P. Richard and K. Chung, Strong Valid Inequalities for Orthogonal Disjunctions and Bilinear Covering Sets, Mathematical Programming, 124, 481-512. 2010.

[4]

Richard, J.-P. P., and M. Tawarmalani, Lifting Inequalities: A Framework for Generating Strong Cuts for Nonlinear Programs, Mathematical Programming, 121, 61-104, 2010.

[5]

Bao, X., N. V. Sahinidis, and M. Tawarmalani, Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs, Optimization Methods & Software, 24, 485-504, 2009.

[6]

Tawarmalani, M., K. Kannan, and P. De, Allocating Objects in a Network of Caches: Centralized and Decentralized Analyses Management Science, 55, 132-147, 2009.

[7]

Sahinidis, N. V. and M. Tawarmalani, Accelerating branch-and-bound through a language specific construct for relaxation-specific constraints, Journal of Global Optimization, 32, 259–280, 2005.

[8]

Tawarmalani, M. and N. V. Sahinidis, A Polyhedral Branch-and-Cut Approach to Global Optimization, Mathematical Programming, 103, 229–249, 2005.

[9]

Ahmed, S., M. Tawarmalani and N. V. Sahinidis, A Finite Branch and Bound Algorithm for Two-Stage Stochastic Integer Programs, Mathematical Programming, 100, 355–377, 2004.

[10]

Tawarmalani, M. and N. V. Sahinidis, Global Optimization of Mixed Integer Nonlinear Programs: A Theoretical and Computational Study, Mathematical Programming, 99, 563–591, 2004.

[11]

Sahinidis, N. V., M. Tawarmalani and M. Yu, Design of Alternative Refrigerants via Global Optimization, American Institute of Chemical Engineers (AICHE) Journal, 49(7) 1761–1775, 2003.

[12]

Tawarmalani, M. and N. V. Sahinidis, Convex Extensions and Envelopes of Lower Semi-continuous Functions, Mathematical Programming, 93, 247-263, 2002.

[13]

Tawarmalani, M., S. Ahmed and N. V. Sahinidis, Product Disaggregation and Relaxations of Mixed-Integer Rational Programs, Optimization and Engineering, 3, 281-303, 2002.

[14]

Tawarmalani, M, S. Ahmed and N. V. Sahinidis, Global Optimization of 0-1 Hyperbolic Programs, Journal of Global Optimization, 24, 385-417, 2002.

[15]

Tawarmalani, M. and N. V. Sahinidis, Semidefinite Relaxations of Fractional Programs via Novel Convexification Techniques, with N. V. Sahinidis, Journal of Global Optimization, 20, 137-158, 2001.

[16]

Sahinidis, N. V. and M. Tawarmalani, Applications of Global Optimization to Process and Molecular Design, Computers & Chemical Engineering, 24, 2157-2169, 2000.

[17]

Adhya, N., M. Tawarmalani and N. V. Sahinidis, A Lagrangian Approach to the Pooling Problem, Industrial & Engineering Chemistry Research, 38(5), 1956-1972, 1999.

Refereed Book Chapters

[1]

Tawarmalani, M. and N. V. Sahinidis, Exact Algorithms for Mixed Integer Nonlinear Programming, Handbook of Global Optimization, Volume 2, P. M. Pardalos and H. E. Romeijn (eds.), Kluwer Academic Publishers, 2002.

[2]

Tawarmalani, M. and N. V. Sahinidis, The Time Dependent Traveling Salesman Problem, Encyclopedia of Optimization, C. A. Floudas and P. M. Pardalos (eds.) Kluwer Academic Publishers, Vol 5, 445-450, 2001.

Working Papers

[1]

Chung K., J.-P. P. Richard, and M. Tawarmalani, Lifted Inequalities for 0-1 Mixed-Integer Bilinear Covering Sets, Mathematical Programming, submitted.
http://www.optimization-online.org/DB_HTML/2011/03/2949.html.

[2]

Tawarmalani, M., Inclusion Certificates and Simultaneous Convexification of Functions, Mathematical Programming, submitted.
http://www.optimization-online.org/DB_HTML/2010/09/2722.html.

[3]

Tawarmalani, M., J.-P. P. Richard, and C. Xiong, Explicit convex and concave envelopes through polyhedral subdivisions, Mathematical Programming, submitted.
http://www.optimization-online.org/DB_HTML/2010/06/2640.html.

[4]

Nguyen, T. T., M. Tawarmalani, and J.-P. P. Richard, Convexification Techniques for Linear Complementarity Constraints, working paper.

[5]

Nallasivam, U., V. H. Shah, A. A. Shenvi, M. Tawarmalani, and R. Agrawal, Global Optimization of Multicomponent Distillation Configurations: 1. Need for Global Minimization Algorithm, working paper.

[6]

Nallasivam, U., V. H. Shah, A. A. Shenvi, M. Tawarmalani, and R. Agrawal, Global Optimization of Multicomponent Distillation Configurations: 2. Enumeration based Minimization Algorithm, working paper.

[7]

Kannan, K., M. Rahman, and M. Tawarmalani, Economics and policy implications of restricted patch distribution on software maintenance, working paper.

Refereed Conference Proceedings

[1]

Nguyen, T. T., M. Tawarmalani, and J.-P. P. Richard, Convexification Techniques for Linear Complementarity Constraints, 15th conference on Integer Programming and Combinatorial Optimization, NY, 2011.

[2]

Hajjat, M., X. Sun, Y.W. Sung, D. Maltz, S. G. Rao, K. Sripanidkulchai, and M. Tawarmalani, Cloudward bound: Planning for Beneficial Migration of Enterprise Applications to the Cloud, Proceedings of ACM Sigcomm, 2010.

[3]

Xia, Q., O. Ersoy, M. Tawarmalani, and H. Moskowitz, Interactive Clustering and Classification, Proceedings of Artificial Neural Networks in Engineering, ANNIE 2008, 463–470, St. Louis, 2008.

[4]

Tawarmalani, M., K. Kannan and P. De, A Mechanism for Allocating Objects in a Network of Symmetric Caches, Proceedings of the Fifteenth Workshop on Information Technologies and Systems, Las Vegas, 249–254, 2005.

Presentations

[1]

Nguyen, T. T., M. Tawarmalani, and J.-P. P. Richard, Convexification Techniques for Linear Complementarity Constraints, 15th conference on Integer Programming and Combinatorial Optimization, 2011.

[2]

Tawarmalani, M., T. T. Nguyen, and J.-P. P. Richard, On Convex Relaxations for Orthogonal Disjunctions and Complementarity Constraints, Exploratory Workshop of Mixed-Integer Nonlinear Programming, Seville, Spain, 2010.

[3]

Nallasivam, U., V. H. Shah, A. A. Shenvi, R. Agrawal, and M. Tawarmalani, Global Optimization of Multicomponent Distillation Configurations, Salt Lake City, 2010.

[4]

Tawarmalani, M., J.-P. P. Richard, and C. Xiong, Explicit Envelopes through Polyhedral Subdivisions, INFORMS Annual Meeting, Austin, 2010.

[5]

Tawarmalani, M., Simultaneous Convexification of Nonlinear Functions and Sets, INFORMS Annual Meeting, Austin, 2010.

[6]

Nguyen, T. T, J.-P. P. Richard, and M. Tawarmalani, Global Optimization Results for Linear Complementarity Problems, INFORMS Annual Meeting, Austin, 2010.

[7]

Hajjat, M., X. Sun, Y.W. Sung, D. Maltz, S. G. Rao, K. Sripanidkulchai, and M. Tawarmalani, Cloudward bound: Planning for Beneficial Migration of Enterprise Applications to the Cloud, ACM Sigcomm, New Delhi, India, 2010.

[8]

J.-P. P. Richard, M. Tawarmalani, and C. Xiong, Explicit Convex and Concave Envelopes via Polyhedral Subdivisions, MIP, Atlanta, 2010.

[9]

Tawarmalani, M. Polyhedrality and Inclusion Certificates in Convexification, European Workshop on Mixed-Integer Nonlinear Programming, Marseille, France, 2010.

[10]

Tawarmalani, M., N. V. Sahinidis, and X. Bao, Exploiting Multilinearity in Global Optimization Relaxations, INFORMS Annual Meeting, San Diego, October 2009.

[11]

C. Xiong, M. Tawarmalani, and J.-P. P. Richard, Convexification of Nonconvex Functions and Polyhedral Envelopes, INFORMS Annual Meeting, San Diego, October 2009.

[12]

Sahinidis, N. V., and M. Tawarmalani, Global Optimization of MINLPs with BARON, INFORMS Annual Meeting, San Diego, October 2009.

[13]

K. Chung, J.-P. P. Richard, and M. Tawarmalani, Strong Valid Inequalities for an MPCC via Orthogonal Disjunctions, INFORMS Annual Meeting, San Diego, October 2009.

[14]

Bao, X., N. V. Sahinidis, and M. Tawarmalani, Polyhedral Relaxations for Nonconvex Quad-ratically-Constrained Quadratic Programs, AIChE Annual Meeting, Philadelphia, November 2008.

[15]

Xia, Q., O. Ersoy, M. Tawarmalani, and H. Moskowitz, Interactive Clustering and Classification, Artificial Neural Networks in Engineering (ANNIE), St. Louis, November 2008.

[16]

Sahinidis, N. V. and M. Tawarmalani, Computational Solution of MINLPs with BARON, INFORMS Annual Meeting, Washington DC, October 2008.

[17]

Sahinidis, N. V. and M. Tawarmalani, A Unifying Framework for Domain Reduction, INFORMS Annual Meeting, Washington DC, October 2008.

[18]

Tawarmalani, M., and J.-P. P. Richard, Strong Inequalities for Disjunctive Sets Via Lifting, INFORMS Annual Meeting, Washington DC, October 2008.

[19]

Tawarmalani, M., K. Chung, and J.-P. P. Richard, Strong Inequalities for Orthogonal Disjunctions and Polynomial Covering Sets, INFORMS Annual Meeting, Washington DC, October 2008.

[20]

Tawarmalani, M., K. Chung, and J.-P. P. Richard, Strong Inequalities for Bilinear Knapsack Sets, INFORMS Optimization Society Conference, Atlanta, March 2008.

[21]

Tawarmalani, M., and J.-P. P. Richard, Lifting Inequalities: Generating Strong Cuts for Nonlinear Programs, INFORMS Optimization Society Conference, Atlanta, March 2008.

[22]

Chung, Kwanghun, M. Tawarmalani, and J.-P. P. Richard, Strong Valid Inequalities for Bilinear Integer Knapsack Sets, INFORMS Annual Meeting, Seattle, November 2007.

[23]

Tawarmalani, M., and J.-P. P. Richard, Extending mixed-integer programming lifting techniques to nonlinear programming, ICCOPT-MOPTA 2007, Hamilton, August 2007.

[24]

Tawarmalani, M., and J-P. P. Richard, Generating Strong Cuts for Nonlinear Programs by Lifting Inequalities, Workshop on Mixed Integer Programming, MIP 2007, Montreal, August 2007.

[25]

Rahman, Mohammad S., K. Kannan and M. Tawarmalani, The Countervailing Incentive of Restricted Patch Distribution: Economic and Policy Implications, Workshop on the Economics of Information Security, Pittsburgh, June 2007.

[26]

Tawarmalani, M., Convex Extensions, Inclusion Certificates and Disjunctive Programming, INFORMS Annual Meeting, Pittsburgh, 2006.

[27]

Tawarmalani, M. and J.-P. P. Richard, MIP Lifting Techniques for Nonlinear Programs, INFORMS Annual Meeting, Pittsburgh, INFORMS Annual Meeting, Pittsburgh, 2006.

[28]

Tawarmalani, M., K. Kannan and P. De, Allocating Objects in a Network of Caches: Centralized and Decentralized Analyses, INFORMS Annual Meeting, Pittsburgh, 2006.

[29]

Tawarmalani, M., Convex Extensions, Inclusion Certificates and Disjunctive Programming, XIX^th Mathematical Programming Symposium, Rio De Janerio, 2006.

[30]

J.-P. Richard and M. Tawarmalani, MIP Lifting Techniques for Mixed-Integer Nonlinear Programs, MIP 2006, Coral Gables, 2006.

[31]

Tawarmalani, M., Inclusion Certificates and Disjunctive Programming, Carnegie Mellon University, Pittsburgh, 2006.

[32]

Tawarmalani, M., K. Kannan and P. De, A Mechanism for Allocating Objects in a Network of Symmetric Caches, Fifteenth Workshop on Information Technologies and Systems, Las Vegas, 2005.

[33]

Tawarmalani, M., Convex Extensions and Convexification of Nonlinear Sets, INFORMS Annual Meeting, San Francisco, November 2005.

[34]

J.-P. Richard and M. Tawarmalani, MIP Lifting Techniques for Mixed-Integer Nonlinear Programs, INFORMS Annual Meeting, San Francisco, November 2005.

[35]

J. Wei, M. Duran, K. Furman, N. V. Sahinidis and M. Tawarmalani, Global Optimization of Stochastic Nonconvex Mixed Integer Nonlinear Programming (MINLP) Problems, INFORMS Annual Meeting, San Francisco, November 2005.

[36]

M. Tawarmalani and Y. Li, Minimizing Flow Disruption due to Network Maintenance, INFORMS Annual Meeting, San Francisco, November 2005.

[37]

N. V. Sahinidis and M. Tawarmalani, Global Optimization with Branch-and-Reduce, INFORMS Annual Meeting, San Francisco, November 2005.

[38]

Tawarmalani, M., K. Kannan. P. De and C. Kumar, Allocating Objects in a Network of Caches: Social Welfare and Incentive Compatibility, First CDGO International Conference, Blacksburg, August 2005.

[39]

Tawarmalani, M. and N. V. Sahinidis, Solving Nonlinear Global Optimization Problems Using BARON, INFORMS ICS 9th Conference, Annapolis, 2005.

[40]

Tawarmalani, M., Convexification and Global Optimization of Nonlinear programs, Workshop on Integer Programming and Continuous Optimization, Chemnitz, November 2004.

[41]

Sahinidis N. V. and M. Tawarmalani, Strengthening Polyhedral Relaxations for Global Optimization Problems, AIChE Annual Meeting, Austin 2004.

[42]

Sahinidis N. V. and M. Tawarmalani, A Polyhedral Branch-and-Cut Algorithm for Global Optimization, INFORMS, Denver, October 2004.

[43]

Tawarmalani, M., Convex Extensions and Convexification of Nonlinear Functions, INFORMS Annual Meeting, Atlanta, October 2003.

[44]

Tawarmalani, M. and N. V. Sahinidis, A Two-Step Procedure for Convexification of Lower Semicontinuous Functions, INFORMS Annual Meeting, Atlanta, October 2003.

[45]

Sahinidis, N. V. and M. Tawarmalani, Global Optimization with GAMS/BARON, Atlanta, October 2003.

[46]

Tawarmalani, M., Convex extensions and polyhedral basis, 18th International Symposium of Mathematical Programming, Denmark, August 2003.

[47]

Sahinidis, N. V. and M. Tawarmalani, Global Optimization with BARON, INFORMS Annual Meeting, San Jose, November 2002.

[48]

Tawarmalani, M. Convex Extensions and Polyhedral Basis, INFORMS, San Jose, November 2002.

[49]

Tawarmalani, M. and N. V. Sahinidis, Finiteness and Convexification Issues in Mixed-Integer Nonlinear Programming, Integer Programming Conference in Honor of Egon Balas, Pittsburgh, PA, June 2002.

[50]

Tawarmalani, M. and N. V. Sahinidis, Global Optimization of Mixed Integer Nonlinear Programs, AICHE Annual Meeting, November 2001.

[51]

Sahinidis, N. V., M. Tawarmalani, M. Yu, and G. Nanda, A Novel MINLP Approach to Molecular Design, AICHE Annual Meeting, November 2001.

[52]

Tawarmalani, M. and N. V. Sahinidis, Convex Envelopes of Nonlinear Functions, INFORMS, Miami, November 2001.

[53]

Sahinidis, N. V. and M. Tawarmalani, Global Optimization of Mixed Integer Nonlinear Programs, INFORMS, Miami, November 2001.

[54]

Tawarmalani, M. and N. V. Sahinidis, Domain Reduction in Global Optimization and Mixed Integer Nonlinear Programs, INFORMS, Miami, November 2001.

[55]

Tawarmalani, M. and N. V. Sahinidis, Global Optimization of Mixed Integer Nonlinear Programs, 17^th International Symposium of Mathematical Programming, Atlanta, August 2000. Programming, Atlanta, 2000.

[56]

Tawarmalani, M. and N. V. Sahinidis, Semidefinite Relaxations of Fractional Programs Via Novel Techniques for Constructing Convex Envelopes of Nonlinear Functions, 17^th International Symposium of Mathematical Programming, Atlanta, August 2000.

[57]

Ahmed, S., M. Tawarmalani, and N. V. Sahinidis, Global Optimization of Two-stage Stochastic Integer Programs, 17^th International Symposium of Mathematical Programming, Atlanta, August 2000.

[58]

Tawarmalani, M. and N. V. Sahinidis, Semidefinite Relaxations of Fractional Programs via Novel Techniques for Constructing Convex Envelopes of Nonlinear Functions, International Conference on Advances in Convex Analysis and Global Optimization Samos, Greece, June 2000.

[59]

Ahmed, S., M. Tawarmalani and N. V. Sahinidis, Global Optimization for Stochastic Integer Programming, International Conference on Advances in Convex Analysis and Global Optimization Samos, Greece, June 2000.

[60]

Tawarmalani, M. and N. V. Sahinidis, Convexification using Convex Extensions and Semidefinite Relaxations of Fractional Programs, INFORMS Annual Meeting, Salt Lake City, Utah, May 2000.

[61]

Ahmed, S., M. Tawarmalani, and N. V. Sahinidis, A Finite Branch and Bound Algorithm for Two-Stage Stochastic Integer Programs, INFORMS Annual Meeting, Salt Lake City, Utah, May 2000.

[62]

Tawarmalani, M., S. Ahmed, and N. V. Sahinidis, Convexification Tools in Integer Programming, INFORMS Annual Meeting, Philadelphia, PA, November 1999.

[63]

Ahmed, S., M. Tawarmalani and N. V. Sahinidis, Global Optimization of Two-Stage Stochastic Mixed-Integer Programs, INFORMS Annual Meeting, Philadelphia, PA, November 1999.

[64]

Sahinidis, N. V., M. Tawarmalani, and M. Yu, Novel Molecular Designs Via Global Optimization, AICHE Annual Meeting, Dallas, TX, October 1999.

[65]

Ahmed, S., M. Tawarmalani and N. V. Sahinidis, A Finite Branch and Bound Scheme for Two-Stage Stochastic Integer Programs, INFORMS Annual Meeting, Cincinnati, OH, May 1999.

[66]

Sahinidis, N. V., M. Tawarmalani, and S. Ahmed, New Results in 0-1 Optimization, AICHE Annual Meeting, Miami Beach, FL, November 1998.

[67]

Tawarmalani, M., S. Ahmed and N. V. Sahinidis, Convexification of 0-1 Fractional Programs, INFORMS Annual Meeting, Seattle, WA, October 1998.

[68]

Tawarmalani, M., N. Adhya and N. V. Sahinidis, Global Optimization of the pooling problem, INFORMS Annual Meeting, Seattle, WA, October 1998.

[69]

Tawarmalani, M., N. Adhya and N. V. Sahinidis, Global Optimization of the pooling problem, 2^nd Engineering Design Automation Conference, Maui, HI, August 1998.

[70]

Tawarmalani, M. and N. V. Sahinidis, Decomposition method for the TDTSP and QAP, INFORMS Annual Meeting, Washington, DC, May 1996.

Software

Co-authored BARON (Branch and Reduce Optimization Navigator) for global optimization of mixed-integer nonlinear programs

Honors

Runner-up, Salgo Noren Foundation Award for Excellence in Teaching, Krannert School, 2009, 2011

2006 Beale-Orchard-Hays prize (with N. V. Sahinidis) for the paper “A polyhedral branch-and-cut approach to global optimization”

Krannert Faculty Fellow, 2006

Best Paper Award (with K. Kannan and P. De) in the fifteenth Workshop on Information Technologies and Systems (2005) for the paper “A Mechanism for Allocating Objects in a Network of Symmetric Caches”

Honorable Mention in 2005 Junior Faculty Interest Group Competition (with Y. Li) for the paper “Minimizing Flow Disruption due to Network Maintenance”

Outstanding Core MBA Teaching Award, 2005, 2006, 2007, 2008, 2009, 2010

INFORMS Computing Society Prize (with N. V. Sahinidis), 2004 for research excellence in the interface between Computer Science and Operations Research

Jay N. Ross Young Faculty Scholar Award, 2002–2003, Purdue University

American Institute of Chemical Engineers (AICHE) Computers and Systems Technology (CAST) Director’s Award, 1999. Best Poster: Novel Molecular Designs Via Global Optimization

CSE Fellow, Computational Science & Engineering, University of Illinois, Jan 1999–May 1999

Teaching Fellow, Department of Mechanical and Industrial Engineering, University of Illinois, Aug 1998–May 1999

Tata Consultancy Services award for best project in the areas of CAD/CAM, Robotics & Automation, July 1993

Grants

National Science Foundation, Collaborative Research: Generating Strong Cuts for Nonlinear Programs Via Orthogonal Disjunctions and Lifting Techniques, $204171, July 2009-June 2012.

Amazon.com, $25000 (with Prof. K. Tang), Evidence Based Solutions for Global Fulfillment Network, June 2007

Huntingburg OFS project under Global Supply Chain Management Initiative, June 2006

Purdue Research Foundation Summer Faculty Grant, Relaxation Hierarchies and Continuous Lifting in Deterministic Global Optimization, 2006

Purdue Research Foundation Summer Faculty Grant, Disjunctive Relaxations of Non-convex Nonlinear Programs, 2005

Professional Memberships

Member of Institute of Operations Research and Management Science since 1996

Web Administrator of Optimization Section of Institute for Operations Research and Management Science 1996-2001

Professional Activities

Editorial Boards: Associate Editor, Journal of Global Optimization, Associate Editor, Mathematical Methods of Operations Research, Technical Editor, Mathematical Programming Computation

Program Committee, 2011 INFORMS Midwest Meeting, 2011

Program Committee, 2009 CPAIOR International Meeting, Pittsburgh, 2009

Organized the Global Optimization Cluster for ICCOPT-MOPTA, Hamilton, 2007

Organized the Global Optimization Cluster for INFORMS, Pittsburgh, 2006

Organized the Global Optimization Cluster for INFORMS, San Francisco, 2005

Vice Chair of Global Optimization, INFORMS Optimization Society, October 2004 to November 2006

Refereed papers for Computers and Chemical Engineering, Computational Optimization and Applications, Discrete Optimization, European Journal of Operational Research, International Journal of Operations and Quantitative Management, International Journal of Systems Science, Journal of Global Optimization, Journal of Industrial and Management Optimization, Journal of Optimization Theory and Applications, Management Science, Mathematical Programming, Operations Research, Operations Research Letters, Optimization and Engineering, Optimization Methods and Software, and SIAM Journal on Optimization.

Developed and Maintained Web Interface for BARON, October 1999–May 2001

Organized Paper Sessions in INFORMS, Miami, 2001, INFORMS, San Jose, 2002, INFORMS Optimization Society Meeting, Atlanta, 2008, and INFORMS, Washington DC, 2008.