Santanu S. Dey

Santanu S. Dey

Georgia Institute of Technology

H-index: 30

North America-United States

About Santanu S. Dey

Santanu S. Dey, With an exceptional h-index of 30 and a recent h-index of 20 (since 2020), a distinguished researcher at Georgia Institute of Technology, specializes in the field of Integer Programming, Global Optimization, Mixed Integer Nonlinear Programming, Operations Research.

His recent articles reflect a diverse array of research interests and contributions to the field:

Regularized MIP Model for Optimal Power Flow with Energy Storage Systems and its Applications

Solving sparse separable bilinear programs using lifted bilinear cover inequalities

Aggregations of quadratic inequalities and hidden hyperplane convexity

Decomposable formulation of transmission constraints for decentralized power systems optimization

Non-Monotonicity of Branching Rules with respect to Linear Relaxations

Lifting convex inequalities for bipartite bilinear programs

A theoretical and computational analysis of full strong-branching

Solving sparse principal component analysis with global support

Santanu S. Dey Information

University

Position

___

Citations(all)

3060

Citations(since 2020)

1782

Cited By

2180

hIndex(all)

30

hIndex(since 2020)

20

i10Index(all)

57

i10Index(since 2020)

40

Email

University Profile Page

Georgia Institute of Technology

Google Scholar

View Google Scholar Profile

Santanu S. Dey Skills & Research Interests

Integer Programming

Global Optimization

Mixed Integer Nonlinear Programming

Operations Research

Top articles of Santanu S. Dey

Title

Journal

Author(s)

Publication Date

Regularized MIP Model for Optimal Power Flow with Energy Storage Systems and its Applications

arXiv preprint arXiv:2402.04406

Dahye Han

Nan Jiang

Santanu S Dey

Weijun Xie

2024/2/6

Solving sparse separable bilinear programs using lifted bilinear cover inequalities

INFORMS Journal on Computing

Xiaoyi Gu

Santanu S Dey

Jean-Philippe P Richard

2024/1/10

Aggregations of quadratic inequalities and hidden hyperplane convexity

SIAM Journal on Optimization

Grigoriy Blekherman

Santanu S Dey

Shengding Sun

2024/3/31

Decomposable formulation of transmission constraints for decentralized power systems optimization

INFORMS Journal on Computing

Álinson Santos Xavier

Santanu Subhas Dey

Feng Qiu

2024/2/27

Non-Monotonicity of Branching Rules with respect to Linear Relaxations

arXiv preprint arXiv:2402.05213

Prachi Shah

Santanu S Dey

Marco Molinaro

2024/2/7

Lifting convex inequalities for bipartite bilinear programs

Mathematical Programming

Xiaoyi Gu

Santanu S Dey

Jean-Philippe P Richard

2023/2

A theoretical and computational analysis of full strong-branching

Mathematical Programming

Santanu S Dey

Yatharth Dubey

Marco Molinaro

Prachi Shah

2023/6/30

Solving sparse principal component analysis with global support

Mathematical Programming

Santanu S Dey

Marco Molinaro

Guanyi Wang

2023/5

On Sparse Canonical Correlation Analysis

arXiv preprint arXiv:2401.00308

Yongchun Li

Santanu S Dey

Weijun Xie

2023/12/30

Lower bounds on the size of general branch-and-bound trees

Mathematical Programming

Santanu S Dey

Yatharth Dubey

Marco Molinaro

2023/3

Sensitivity analysis for mixed binary quadratic programming

arXiv preprint arXiv:2312.06714

Diego Cifuentes

Santanu S Dey

Jingye Xu

2023/12/10

Variable selection for kernel two-sample tests

arXiv preprint arXiv:2302.07415

Jie Wang

Santanu S Dey

Yao Xie

2023/2/15

Optimizing the designs and operations of water networks: a decomposition approach

Yijiang Li

Santanu Dey

Nick Sahinidis

Naresh Susarla

Miguel Zamarripa

...

2023/10/18

Integer programming and combinatorial optimization (IPCO) 2021

Alberto Del Pia

Volker Kaibel

2023/5/21

A decomposition framework for gas network design

arXiv preprint arXiv:2307.07648

Yijiang Li

Santanu S Dey

Nikolaos V Sahinidis

2023/7/14

On obtaining the convex hull of quadratic inequalities via aggregations

SIAM Journal on Optimization

Santanu S Dey

Gonzalo Munoz

Felipe Serrano

2022

A scalable lower bound for the worst-case relay attack problem on the transmission grid

INFORMS Journal on Computing

Emma S Johnson

Santanu Subhas Dey

2022/7

Cutting plane generation through sparse principal component analysis

SIAM Journal on Optimization

Santanu S Dey

Aleksandr Kazachkov

Andrea Lodi

Gonzalo Munoz

2022

Using -Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA

Operations Research

Santanu S Dey

Rahul Mazumder

Guanyi Wang

2022/5

Combinatorial Optimization: 7th International Symposium, ISCO 2022, Virtual Event, May 18–20, 2022, Revised Selected Papers

Ivana Ljubić

Francisco Barahona

Santanu S Dey

A Ridha Mahjoub

2022/11/21

See List of Professors in Santanu S. Dey University(Georgia Institute of Technology)

Co-Authors

H-index: 71
Laurence Wolsey,

Laurence Wolsey,

Université Catholique de Louvain

H-index: 60
Andrea Lodi

Andrea Lodi

École Polytechnique de Montréal

H-index: 51
Shabbir Ahmed

Shabbir Ahmed

Georgia Institute of Technology

H-index: 29
James Luedtke

James Luedtke

University of Wisconsin-Madison

H-index: 29
X. Andy Sun

X. Andy Sun

Georgia Institute of Technology

H-index: 23
Jean-Philippe P. Richard

Jean-Philippe P. Richard

University of Minnesota-Twin Cities

academic-engine