SD
Santanu Dey
math.OCmath.COcs.CCcs.DScs.LGcs.DMstat.MLcs.CLcs.IRstat.AP
On Valency
published · living versionsW_vrj7t2du·v1 · currentpublished
W_vmpmu5e5·v1published
Preprints & journals
64 papers in the corpus · 1996–2026Random projection with linear equalities and inequalities2610.09324v1 · Santanu S. Dey, Jingye Xu2026 · 0 citationsarXiv
Asymptotically tight Lagrangian dual of smooth nonconvex problems via improved error bound of Shapley-Folkman Lemma2601.19003v2 · Santanu S Dey, Jingye Xu2026 · 0 citationsarXiv
Strengthening Dual Bounds for Multicommodity Capacitated Network Design with Unsplittable Flow Constraints2512.25018v1 · Lacy M. Greening, Santanu S. Dey, Alan L. Erera2025 · 0 citationsarXiv
Convexification of a Separable Function over a Polyhedral Ground Set2510.16595v1 · Santanu S. Dey, Burak Kocuk2025 · 0 citationsarXiv
Geoffrion's theorem beyond finiteness and rationality2510.10966v1 · Santanu S. Dey, Fr'ed'eric Meunier, Diego Moran Ramirez2025 · 0 citationsarXiv
Improving Full Strong Branching Decisions by Incorporating Additional Information2507.09455v1 · Prachi Shah, Santanu S. Dey2025 · 0 citationsarXiv
Approximating the Gomory Mixed-Integer Cut Closure Using Historical Data2411.15090v1 · Berkay Becu, Santanu S. Dey, Feng Qiu et al.2024 · 0 citationsarXiv
Lagrangian dual with zero duality gap that admits decomposition2411.12085v1 · Diego Cifuentes, Santanu S. Dey, Jingye Xu2024 · 0 citationsarXiv
Branching with a pre-specified finite list of -sparse split sets for binary MILPs2408.05392v1 · Santanu S. Dey, Diego Moran, Jingye Xu2024 · 0 citationsarXiv
Non-Monotonicity of Branching Rules with respect to Linear Relaxations2402.05213v1 · Prachi Shah, Santanu S. Dey, Marco Molinaro2024 · 1 citationarXiv
Regularized MIP Model for Integrating Energy Storage Systems and its Application for Solving a Trilevel Interdiction Problem2402.04406v2 · Dahye Han, Nan Jiang, Santanu S. Dey et al.2024 · 1 citationarXiv
Sensitivity analysis for mixed binary quadratic programming2312.06714v2 · Diego Cifuentes, Santanu S. Dey, Jingye Xu2023 · 3 citationsarXiv
A reformulation-enumeration MINLP algorithm for gas network design2307.07648v3 · Yijiang Li, Santanu S. Dey, Nikolaos V. Sahinidis2023 · 6 citationsarXiv
Variable Selection for Kernel Two-Sample Tests2302.07415v4 · Jie Wang, Santanu S. Dey, Yao Xie2023 · 1 citationarXiv
Aggregations of quadratic inequalities and hidden hyperplane convexity2210.01722v2 · Grigoriy Blekherman, Santanu S. Dey, Shengding Sun2022 · 2 citationsarXiv
Exploiting Instance and Variable Similarity to Improve Learning-Enhanced Branching2208.10028v1 · Xiaoyi Gu, Santanu S. Dey, 'Alinson S. Xavier et al.2022 · 0 citationsarXiv
Solving sparse separable bilinear programs using lifted bilinear cover inequalities2208.00345v1 · Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard2022 · 0 citationsarXiv
Node-based valid inequalities for the optimal transmission switching problem2112.13209v1 · Santanu S. Dey, Burak Kocuk, Nicole Redder2021 · 6 citationsarXiv
Lower bound on size of branch-and-bound trees for solving lot-sizing problem2112.03965v1 · Santanu S. Dey, Prachi Shah2021 · 4 citationsarXiv
A Theoretical and Computational Analysis of Full Strong-Branching2110.10754v2 · Santanu S. Dey, Yatharth Dubey, Marco Molinaro et al.2021 · 25 citationsarXiv
Lifting convex inequalities for bipartite bilinear programs2106.12625v1 · Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard2021 · 3 citationsarXiv
On obtaining the convex hull of quadratic inequalities via aggregations2106.12629v1 · Santanu S. Dey, Gonzalo Munoz, Felipe Serrano2021 · 4 citationsarXiv
A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid2105.02801v2 · Emma S. Johnson, Santanu S. Dey2021 · 11 citationsarXiv
Lower Bounds on the Size of General Branch-and-Bound Trees2103.09807v2 · Santanu S. Dey, Yatharth Dubey, Marco Molinaro2021 · 22 citationsarXiv
Hyperbolic Relaxation of -Locally Positive Semidefinite Matrices2012.04031v2 · Grigoriy Blekherman, Santanu S. Dey, Kevin Shu et al.2020 · 10 citationsarXiv
Using Submodularity within Column Generation to Solve the Flight-to-Gate Assignment Problem2011.05894v3 · Yijiang Li, John-Paul Clarke, Santanu Dey2020 · 29 citationsarXiv
Solving sparse principal component analysis with global support2010.11152v3 · Santanu S. Dey, Marco Molinaro, Guanyi Wang2020 · 3 citationsarXiv
Branch-and-Bound Solves Random Binary IPs in Polytime2007.15192v4 · Santanu S. Dey, Yatharth Dubey, Marco Molinaro2020 · 23 citationsarXiv
A K-Nearest Neighbor Heuristic for Real-Time DC Optimal Transmission Switching2003.10565v3 · Emma S. Johnson, Shabbir Ahmed, Santanu S. Dey et al.2020 · 9 citationsarXiv
Sparse PSD approximation of the PSD cone2002.02988v1 · Grigoriy Blekherman, Santanu S. Dey, Marco Molinaro et al.2020 · 16 citationsarXiv
Decomposable Formulation of Transmission Constraints for Decentralized Power Systems Optimization2001.07771v2 · Alinson S. Xavier, Feng Qiu, Santanu S. Dey2020 · 15 citationsarXiv
Order Matters at Fanatics Recommending Sequentially Ordered Products by LSTM Embedded with Word2Vec1911.09818v1 · Jing Pan, Weian Sheng, Santanu Dey2019 · 0 citationsarXiv
Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming1907.00920v1 · Xiaoyi Gu, Shabbir Ahmed, Santanu S. Dey2019 · 13 citationsarXiv
A study of rank-one sets with linear side constraints and application to the pooling problem1902.00739v1 · Santanu S. Dey, Burak Kocuk, Asteroide Santana2019 · 1 citationarXiv
The convex hull of a quadratic constraint over a polytope1812.10160v1 · Asteroide Santana, Santanu S. Dey2018 · 22 citationsarXiv
Using L1-relaxation and integer programming to obtain dual bounds for sparse PCA1810.09062v3 · Santanu S. Dey, Rahul Mazumder, Guanyi Wang2018 · 1 citationarXiv
An Approximation Algorithm for training One-Node ReLU Neural Network1810.03592v2 · Santanu S. Dey, Guanyi Wang, Yao Xie2018 · 5 citationsarXiv
Subset selection in sparse matrices1810.02757v2 · Alberto Del Pia, Santanu S. Dey, Robert Weismantel2018 · 6 citationsarXiv
Complexity of Training ReLU Neural Network1809.10787v2 · Digvijay Boob, Santanu S. Dey, Guanghui Lan2018 · 80 citationsarXiv
Theoretical challenges towards cutting-plane selection1805.02782v1 · Santanu S. Dey, Marco Molinaro2018 · 44 citationsarXiv
New SOCP relaxation and branching rule for bipartite bilinear programs1803.09266v1 · Santanu S. Dey, Asteroide Santana, Yang Wang2018 · 20 citationsarXiv
Sparse principal component analysis and its -relaxation1712.00800v1 · Santanu S. Dey, Rahul Mazumder, Marco Molinaro et al.2017 · 1 citationarXiv
The Strength of Multi-row Aggregation Cuts for Sign-pattern Integer Programs1711.06963v1 · Santanu S. Dey, Andres Iroume, Guanyi Wang2017 · 2 citationsarXiv
Lower bounds on the lattice-free rank for packing and covering integer programs1710.00031v2 · Merve Bodur, Alberto Del Pia, Santanu S. Dey et al.2017 · 2 citationsarXiv
Matrix Minor Reformulation and SOCP-based Spatial Branch-and-Cut Method for the AC Optimal Power Flow Problem1703.03050v1 · Burak Kocuk, Santanu S. Dey, X. Andy Sun2017 · 60 citationsarXiv
Improving the Randomization Step in Feasibility Pump1609.08121v1 · Santanu S. Dey, Andres Iroume, Marco Molinaro et al.2016 · 8 citationsarXiv
Aggregation-based cutting-planes for packing and covering integer programs1606.08951v1 · Merve Bodur, Alberto Del Pia, Santanu S. Dey et al.2016 · 22 citationsarXiv
Some cut-generating functions for second-order conic sets1606.00385v3 · Asteroide Santana, Santanu S. Dey2016 · 8 citationsarXiv
Non-unique lifting of integer variables in minimal inequalities1605.06686v4 · Amitabh Basu, Santanu S. Dey, Joseph Paat2016 · 1 citationarXiv
Strong mixed-integer formulations for the floor layout problem1602.07760v2 · Joey Huchette, Santanu S. Dey, Juan Pablo Vielma2016 · 7 citationsarXiv
Career total: 144 works. 64 are in this corpus.Showing the 50 most recent.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.