Santanu Subhas Dey
Orcid: 0000-0003-0294-8287Affiliations:
- Georgia Institute of Technology, Atlanta, GA, USA
According to our database1,
Santanu Subhas Dey
authored at least 83 papers
between 2007 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Math. Program., May, 2024
SIAM J. Optim., March, 2024
INFORMS J. Comput., 2024
Proceedings of the Integer Programming and Combinatorial Optimization, 2024
2023
Math. Program., May, 2023
Math. Program., March, 2023
Math. Program., February, 2023
Math. Program., February, 2023
2022
SIAM J. Optim., 2022
SIAM J. Optim., 2022
SIAM J. Optim., 2022
Oper. Res. Lett., 2022
Special Issue: Global Solution of Integer, Stochastic and Nonconvex Optimization Problems.
Math. Program., 2022
Oper. Res., 2022
A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid.
INFORMS J. Comput., 2022
Discret. Optim., 2022
2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
2020
IEEE Trans. Signal Process., 2020
SIAM J. Optim., 2020
Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem.
J. Glob. Optim., 2020
Proceedings of the 37th International Conference on Machine Learning, 2020
2019
SIAM J. Optim., 2019
SIAM J. Discret. Math., 2019
2018
Oper. Res. Lett., 2018
Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem.
Math. Program. Comput., 2018
Math. Program., 2018
Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs.
Math. Oper. Res., 2018
INFOR Inf. Syst. Oper. Res., 2018
INFOR Inf. Syst. Oper. Res., 2018
2017
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions.
Math. Program., 2017
2016
Oper. Res. Lett., 2016
A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching.
Oper. Res., 2016
Discret. Appl. Math., 2016
2015
Oper. Res. Lett., 2015
2014
Proceedings of the Integer Programming and Combinatorial Optimization, 2014
2013
SIAM J. Optim., 2013
Math. Program., 2013
A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013
2012
Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra.
Math. Program., 2012
2011
2010
Math. Program., 2010
Composite lifting of group inequalities and an application to two-row mixing inequalities.
Discret. Optim., 2010
Proceedings of the Integer Programming and Combinatorial Optimization, 2010
Proceedings of the Integer Programming and Combinatorial Optimization, 2010
Proceedings of the 50 Years of Integer Programming 1958-2008, 2010
2009
Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms.
INFORMS J. Comput., 2009
2008
Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles.
Proceedings of the Integer Programming and Combinatorial Optimization, 2008
2007
Proceedings of the Integer Programming and Combinatorial Optimization, 2007