Santanu Dey

Director of Doctoral Recruiting and Admissions and
Anderson-Interface Chair and
Professor

Contact

 Groseclose 442
 404.385.7483
 Personal website
  Contact
  • Santanu Dey Google Scholar

Education

  • Ph.D. Industrial Engineering (2007), Purdue University
  • M.S. Industrial Engineering (2003), Purdue University
  • B.E. Mechanical Engineering (2000), Mumbai University

Expertise

  • Optimization

About

Santanu Dey is an Anderson-Interface Chair and Professor in the H. Milton Stewart School of Industrial and Systems Engineering at Georgia Tech. He currently serves as the director of doctoral recruiting and admissions in the H. Milton Stewart School of Industrial and Systems Engineering. Dr. Dey holds a Ph.D. in Industrial Engineering from Purdue University. Prior to joining Georgia Tech, he worked as a post-doctoral fellow at the Center for Operations Research and Econometrics (CORE) of the Catholic University of Louvain in Belgium.

He currently serves on the editorial board of Mathematical Programming A and SIAM Journal on Optimization. Dr. Dey has served as the vice chair for Integer Programming for INFORMS Optimization Society (2011-2013). He has been as associate editor for INFORMS Journal on Computing, Computational Optimization and Applications, Mathematics of Operations Research,  an area editor for Mathematical Programming C, and has served on the editorial board of MOS-SIAM book series on Optimization.

Research

Dr. Dey's research interests are in the design and evaluation of algorithms for solving non-convex optimization problems, and in particular mixed integer linear and nonlinear programming problems. His research is partly motivated by applications of non-convex optimization arising in areas such as electrical power engineering, process engineering, structural engineering, logistics, and statistics. Dr. Dey's research has been supported by the U.S. Department of Energy, National Science Foundation, Office of Naval Research, Airforce Office of Scientific Research, Argonne National Lab, and Sandia National Lab. See list of publications here.

Teaching

Dr. Dey enjoys teaching courses in the area of Optimization and related fields. At the undergraduate level he has taught: ISyE 3133 (Engineering Optimization), ISyE 4133 (Advanced Optimization), and ISyE 4106 (Senior Design). At the graduate level, he has taught: ISyE 6661 (Linear Optimization), ISyE 6669 (Deterministic Optimization), ISyE 6662 (Discrete Optimization), ISyE 7661(Theory of Linear Inequalities), ISyE 7687 (Advanced Integer Programming), and ISYE 8813 (Global Optimization). 

Awards and Honors

  • INFORMS optimization society Balas prize 2020.
  • INFORMS ENRE Best Publication - Energy 2019.
  • A. Russell Chandler III Professorship from ISyE 2019-2022.
  • Fouts Family Junior Professorship from ISyE 2013-2016.
  • Finalist in INFORMS junior faculty interest group paper competition 2010, 2011, 2012.
  • CAREER Award, National Science Foundation 2012.
  • Class of 1969 Teaching Fellow, Center for the Enhancement of Teaching and Learning (CETL), Georgia Institute of Technology 2010.
  • IBM Faculty Award 2009.

Representative Publications

  • Diego Cifuentes, Santanu S. Dey, Jingye Xu, "Sensitivity analysis for mixed binary quadratic programming," Mathematical Programming, 2025. doi.
  • Dahye Han, Nan Jiang, Santanu S. Dey, and Weijun Xie, "Regularized MIP Model for Integrating Energy Storage Systems and Its Application for Solving a Trilevel Interdiction Problem," INFORMS Journal on Computing, 2025. doi.
  • Prachi Shah, Santanu S. Dey, Marco Molinaro, "Non-Monotonicity of Branching Rules with respect to Linear Relaxations," INFORMS Journal on Computing, 2025. doi.
  • Alinson S. Xavier, Santanu S. Dey, Feng Qiu, "Decomposable Formulation of Transmission Constraints for Decentralized Power Systems Optimization," INFORMS Journal on Computing, 36, 1562 - 1578, 2024. doi.
  • Grigoriy Blekherman, Santanu S. Dey, Shengding Sun, "Aggregation of quadratic inequalities and hidden hyperplane convexity," SIAM Journal on Optimization, 34, 98-126, 2024. doi.
  • Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard, "Solving sparse separable bilinear programs using lifted bilinear cover inequalities," INFORMS Journal on Computing, 36, 884-899, 2024. doi.
  • Santanu S. Dey, Yatharth Dubey, Marco Molinaro, Prachi Shah, "A Theoretical and Computational Analysis of Full Strong-Branching," Mathematical Programming, 205, 303-336, 2024. doi.
  • Santanu S. Dey, Yatharth Dubey, Marco Molinaro, "Branch-and-bound solves random binary IPs in poly(n)-time," Mathematical Programming, 200, 569-587, 2023. doi.
  • Santanu S. Dey, Marco Molinaro, Guanyi Wang "Solving sparse principal component analysis with global support," Mathematical Programming 199, 421-459, 2023. doi.
  • Santanu S. Dey, Yatharth Dubey, Marco Molinaro, "Lower Bounds on the size of general branch-and-bound trees," Mathematical Programming, 198, 539-559, 2023. doi.
  • Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard, "Lifting convex inequalities for bipartite bilinear programs," Mathematical Programming, 197, 587-619, 2023. doi.
  • Emma S. Johnson, Santanu S. Dey, "A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid," INFORMS Journal on Computing, 34, 2296-2312, 2022. doi.
  • Santanu S. Dey, Aleksandr M. Kazachkov, Andrea Lodi, Gonzalo Munoz, "Cutting Plane Generation Through Sparse Principal Component Analysis," SIAM Journal on Optimization, 32, 1319-1343, 2022. doi.
  • Santanu S. Dey, Gonzalo Munoz, Felipe Serrano, "On obtaining the convex hull of quadratic inequalities via aggregations," SIAM Journal on Optimization, 32, 659-686, 2022. doi.
  • Grigoriy Blekherman, Santanu S. Dey, Kevin Shu, Shengding Sun, "Hyperbolic relaxation of k-Locally positive semidefinite matrices," SIAM Journal on Optimization, 32, 470-490, 2022. doi.
  • Grigoriy Blekherman, Santanu S. Dey, Marco Molinaro, Shengding Sun, "Sparse PSD approximation of the PSD cone," Mathematical Programming, 191, 981-1004, 2022. doi.
  • Santanu S. Dey, Rahul Mazumder, Guanyi Wang, "Using l1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA," Operations Research, 70, 1914-1932, 2021. doi.
  • Yijiang Li, John-Paul Clarke, Santanu S. Dey, "Using Submodularity within Column Generation to Solve the Flight-to-Gate Assignment Problem," Transportation Research Part C, 129, 103217, 2021. doi.