Research Areas Optimization Discrete and Combinatorial Geometry Operations Research Convex Analysis Statistical and machine learning

Amitabh Basu is a professor of applied mathematics and statistics with a secondary appointment in computer science. He is an expert in the fields of optimization, discrete and combinatorial geometry, operations research, and convex analysis. 

Basu utilizes integer programming and convex analysis to break new ground in optimization research. His work aims to provide methods for solving large-scale, decision-making problems where a combination of discrete choices and non-discrete choices must be made to optimize a given objective. He incorporates techniques from convex geometry, the geometry of numbers, functional analysis, algebraic topology, and real algebraic geometry to reach technical breakthroughs in mixed-integer optimization. Basu’s research has practical applications in a number of fields, including operations research, astronomy, and data science. 

Basu serves on the editorial boards of Mathematics of Operations Research, Discrete Optimization, MOS-SIAM Series on Optimization, Mathematical Programming, and SIAM Journal on Optimization. He has published more than 50 papers in nearly a dozen peer-reviewed journals. His work has been funded by the National Science Foundation, the Office of Naval Research, the Air Force Office of Scientific Research, and the American Mathematical Society. Basu’s awards include an AMS-Simons Travel award, a U.S. Junior Oberwolfach fellowship from the Mathematisches Forschungsinstitut Oberwolfach (MFO), and a 2015 NSF CAREER award, and the Egon Balas Prize from the INFORMS Optimization Society. He was also one of three finalists for the prestigious A.W. Tucker Prize, which is awarded by the Mathematical Optimization Society every three years.

He received a bachelors degree in computer science and engineering from the Indian Institute of Technology, Delhi, in 2004 and a masters degree in computer science from Stony Brook University in 2006. In 2010, he earned his PhD from Carnegie Mellon University, where he studied algorithms, combinatorics, and optimization. Basu joined Johns Hopkins in 2013 following a three-year visiting assistant professor appointment at the University of California, Davis.