Santanu S. Dey

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 51

Top Topics

Integer Program

Valid Inequalities

Top Venues

INFORMS J. Comput.

Publications

Grigoriy Blekherman, Santanu S. Dey, Shengding Sun
Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity. SIAM J. Optim. 34 (1) (2024)
Diego Cifuentes, Santanu S. Dey, Jingye Xu
Sensitivity Analysis for Mixed Binary Quadratic Programming. IPCO (2024)
Santanu S. Dey, Yatharth Dubey, Marco Molinaro, Prachi Shah
A theoretical and computational analysis of full strong-branching. Math. Program. 205 (1) (2024)
Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard
Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover Inequalities. INFORMS J. Comput. 36 (3) (2024)
Santanu S. Dey, Yatharth Dubey, Marco Molinaro
Lower bounds on the size of general branch-and-bound trees. Math. Program. 198 (1) (2023)
Santanu S. Dey, Yatharth Dubey, Marco Molinaro
Branch-and-bound solves random binary IPs in poly(n)-time. Math. Program. 200 (1) (2023)
Santanu S. Dey, Marco Molinaro, Guanyi Wang
Solving sparse principal component analysis with global support. Math. Program. 199 (1) (2023)
Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard
Lifting convex inequalities for bipartite bilinear programs. Math. Program. 197 (2) (2023)
Santanu S. Dey, Gonzalo Muñoz, Felipe Serrano
On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations. SIAM J. Optim. 32 (2) (2022)
Santanu S. Dey, Aleksandr M. Kazachkov, Andrea Lodi, Gonzalo Muñoz
Cutting Plane Generation through Sparse Principal Component Analysis. SIAM J. Optim. 32 (2) (2022)
Santanu S. Dey, Prachi Shah
Lower bound on size of branch-and-bound trees for solving lot-sizing problem. Oper. Res. Lett. 50 (5) (2022)
Grigoriy Blekherman, Santanu S. Dey, Marco Molinaro, Shengding Sun
Sparse PSD approximation of the PSD cone. Math. Program. 191 (2) (2022)
Digvijay Boob, Santanu S. Dey, Guanghui Lan
Complexity of training ReLU neural network. Discret. Optim. 44 (Part) (2022)
Grigoriy Blekherman, Santanu S. Dey, Kevin Shu, Shengding Sun
Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices. SIAM J. Optim. 32 (2) (2022)
Santanu S. Dey, Burak Kocuk, Nicole Redder
Node-based valid inequalities for the optimal transmission switching problem. Discret. Optim. 43 (2022)
Emma S. Johnson, Santanu S. Dey
A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid. INFORMS J. Comput. 34 (4) (2022)
Santanu S. Dey, James R. Luedtke, Nikolaos V. Sahinidis
Special Issue: Global Solution of Integer, Stochastic and Nonconvex Optimization Problems. Math. Program. 196 (1) (2022)
Santanu S. Dey, Rahul Mazumder, Guanyi Wang
Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA. Oper. Res. 70 (3) (2022)
Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard
Lifting Convex Inequalities for Bipartite Bilinear Programs. IPCO (2021)
Santanu S. Dey, Yatharth Dubey, Marco Molinaro
Branch-and-Bound Solves Random Binary IPs in Polytime. SODA (2021)
Santanu S. Dey, Yatharth Dubey, Marco Molinaro
Lower Bounds on the Size of General Branch-and-Bound Trees. CoRR (2021)
Santanu S. Dey, Burak Kocuk, Asteroide Santana
Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem. J. Glob. Optim. 77 (2) (2020)
Guanyi Wang, Santanu S. Dey
Upper bounds for Model-Free Row-Sparse Principal Component Analysis. ICML (2020)
Asteroide Santana, Santanu S. Dey
The Convex Hull of a Quadratic Constraint over a Polytope. SIAM J. Optim. 30 (4) (2020)
Santanu S. Dey, Guanyi Wang, Yao Xie
Approximation Algorithms for Training One-Node ReLU Neural Networks. IEEE Trans. Signal Process. 68 (2020)
Xiaoyi Gu, Shabbir Ahmed, Santanu S. Dey
Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming. SIAM J. Optim. 30 (1) (2020)
Santanu S. Dey, Yatharth Dubey, Marco Molinaro
Branch-and-Bound Solves Random Binary Packing IPs in Polytime. CoRR (2020)
Alberto Del Pia, Santanu S. Dey, Robert Weismantel
Subset Selection in Sparse Matrices. SIAM J. Optim. 30 (2) (2020)
Kevin Ryan, Shabbir Ahmed, Santanu S. Dey, Deepak Rajan, Amelia Musselman, Jean-Paul Watson
Optimization-Driven Scenario Grouping. INFORMS J. Comput. 32 (3) (2020)
Amitabh Basu, Santanu S. Dey, Joseph Paat
Nonunique Lifting of Integer Variables in Minimal Inequalities. SIAM J. Discret. Math. 33 (2) (2019)
Merve Bodur, Alberto Del Pia, Santanu S. Dey, Marco S. Molinaro
Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs. SIAM J. Optim. 29 (1) (2019)
Merve Bodur, Alberto Del Pia, Santanu S. Dey, Marco Molinaro, Sebastian Pokutta
Aggregation-based cutting-planes for packing and covering integer programs. Math. Program. 171 (1-2) (2018)
Santanu S. Dey, Marco Molinaro, Qianyi Wang
Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs. Math. Oper. Res. 43 (1) (2018)
Digvijay Boob, Santanu S. Dey, Guanghui Lan
Complexity of Training ReLU Neural Network. CoRR (2018)
Joey Huchette, Santanu S. Dey, Juan Pablo Vielma
Strong mixed-integer formulations for the floor layout problem. INFOR Inf. Syst. Oper. Res. 56 (4) (2018)
Burak Kocuk, Santanu S. Dey, Xu Andy Sun
Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem. Math. Program. Comput. 10 (4) (2018)
Santanu S. Dey, Andres Iroume, Marco Molinaro, Domenico Salvagnin
Improving the Randomization Step in Feasibility Pump. SIAM J. Optim. 28 (1) (2018)
Santanu S. Dey, Marco Molinaro
Theoretical challenges towards cutting-plane selection. Math. Program. 170 (1) (2018)
Alberto Del Pia, Santanu S. Dey, Robert Weismantel
Subset selection in sparse matrices. CoRR (2018)
Santanu S. Dey, Andres Iroume, Guanyi Wang
The strength of multi-row aggregation cuts for sign-pattern integer programs. Oper. Res. Lett. 46 (6) (2018)
Joey Huchette, Santanu S. Dey, Juan Pablo Vielma
Beating the SDP bound for the floor layout problem: a simple combinatorial idea. INFOR Inf. Syst. Oper. Res. 56 (4) (2018)
Asteroide Santana, Santanu S. Dey
Some cut-generating functions for second-order conic sets. Discret. Optim. 24 (2017)
Akshay Gupte, Shabbir Ahmed, Santanu S. Dey, Myun-Seok Cheon
Relaxations and discretizations for the pooling problem. J. Glob. Optim. 67 (3) (2017)
Natashia Boland, Santanu S. Dey, Thomas Kalinowski, Marco Molinaro, Fabian Rigterink
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions. Math. Program. 162 (1-2) (2017)
Alberto Del Pia, Santanu S. Dey, Marco Molinaro
Mixed-integer quadratic programming is in NP. Math. Program. 162 (1-2) (2017)
Burak Kocuk, Santanu S. Dey, Xu Andy Sun
Strong SOCP Relaxations for the Optimal Power Flow Problem. Oper. Res. 64 (6) (2016)
Burak Kocuk, Hyemin Jeon, Santanu S. Dey, Jeff T. Linderoth, James R. Luedtke, Xu Andy Sun
A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching. Oper. Res. 64 (4) (2016)
Diego A. Morán R., Santanu S. Dey
Closedness of Integer Hulls of Simple Conic Sets. SIAM J. Discret. Math. 30 (1) (2016)
Feng Qiu, Shabbir Ahmed, Santanu S. Dey
Strengthened bounds for the probability of k-out-of-n events. Discret. Appl. Math. 198 (2016)
Gustavo Angulo, Shabbir Ahmed, Santanu S. Dey
Improving the Integer L-Shaped Method. INFORMS J. Comput. 28 (3) (2016)
Matthias Walter, Pelin Damci-Kurt, Santanu S. Dey, Simge Küçükyavuz
On a cardinality-constrained transportation problem with market choice. Oper. Res. Lett. 44 (2) (2016)
Santanu S. Dey, Akshay Gupte
Analysis of MILP Techniques for the Pooling Problem. Oper. Res. 63 (2) (2015)
Santanu S. Dey, Andres Iroume, Marco Molinaro
Some lower bounds on sparse outer approximations of polytopes. Oper. Res. Lett. 43 (3) (2015)
Santanu S. Dey, Marco Molinaro, Qianyi Wang
Approximating polyhedra with sparse inequalities. Math. Program. 154 (1-2) (2015)
Gustavo Angulo, Shabbir Ahmed, Santanu S. Dey, Volker Kaibel
Forbidden Vertices. Math. Oper. Res. 40 (2) (2015)
Pelin Damci-Kurt, Santanu S. Dey, Simge Küçükyavuz
On the transportation problem with market choice. Discret. Appl. Math. 181 (2015)
Alberto Del Pia, Santanu S. Dey, Marco Molinaro
Mixed-integer Quadratic Programming is in NP. CoRR (2014)
Santanu S. Dey, Marco Molinaro, Qianyi Wang
How Good Are Sparse Cutting-Planes? IPCO (2014)
Santanu S. Dey, Andrea Lodi, Andrea Tramontani, Laurence A. Wolsey
On the Practical Strength of Two-Row Tableau Cuts. INFORMS J. Comput. 26 (2) (2014)
Feng Qiu, Shabbir Ahmed, Santanu S. Dey, Laurence A. Wolsey
Covering Linear Programming with Violations. INFORMS J. Comput. 26 (3) (2014)
Santanu S. Dey, Sebastian Pokutta
Design and verify: a new scheme for generating cutting-planes. Math. Program. 145 (1-2) (2014)
Gustavo Angulo, Shabbir Ahmed, Santanu S. Dey
Semi-continuous network flow problems. Math. Program. 145 (1-2) (2014)
Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma
On the Chvátal-Gomory closure of a compact convex set. Math. Program. 145 (1-2) (2014)
Pelin Damci-Kurt, Santanu S. Dey, Simge Küçükyavuz
On a Cardinality-Constrained Transportation Problem With Market Choice. CoRR (2014)
Santanu S. Dey, Diego A. Morán R.
Some properties of convex hulls of integer points contained in general convex sets. Math. Program. 141 (1-2) (2013)
Akshay Gupte, Shabbir Ahmed, Myun-Seok Cheon, Santanu S. Dey
Solving Mixed Integer Bilinear Problems Using MILP Formulations. SIAM J. Optim. 23 (2) (2013)
Diego Alejandro Morán Ramírez, Santanu S. Dey
A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets. IPCO (2013)
Diego A. Morán R., Santanu S. Dey, Juan Pablo Vielma
A Strong Dual for Conic Mixed-Integer Programs. SIAM J. Optim. 22 (3) (2012)
Sanjeeb Dash, Santanu S. Dey, Oktay Günlük
Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra. Math. Program. 135 (1-2) (2012)
Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma
The Chvátal-Gomory Closure of a Strictly Convex Body. Math. Oper. Res. 36 (2) (2011)
Diego A. Morán R., Santanu S. Dey
On Maximal S-Free Convex Sets. SIAM J. Discret. Math. 25 (1) (2011)
Santanu S. Dey, Quentin Louveaux
Split Rank of Triangle and Quadrilateral Inequalities. Math. Oper. Res. 36 (3) (2011)
Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma
On the Chvátal-Gomory Closure of a Compact Convex Set. IPCO (2011)
Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma
The split closure of a strictly convex body. Oper. Res. Lett. 39 (2) (2011)
Santanu S. Dey
A note on the split rank of intersection cuts. Math. Program. 130 (1) (2011)
Sanjeeb Dash, Santanu S. Dey, Oktay Günlük
On mixed-integer sets with two integer variables. Oper. Res. Lett. 39 (5) (2011)
Santanu S. Dey, Sebastian Pokutta
Design and Verify: A New Scheme for Generating Cutting-Planes. IPCO (2011)
Santanu S. Dey, Jean-Philippe P. Richard, Yanjun Li, Lisa A. Miller
On the extreme inequalities of infinite group problems. Math. Program. 121 (1) (2010)
Santanu S. Dey, Laurence A. Wolsey
Composite lifting of group inequalities and an application to two-row mixing inequalities. Discret. Optim. 7 (4) (2010)
Santanu S. Dey, Juan Pablo Vielma
The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron. IPCO (2010)
Santanu S. Dey, Laurence A. Wolsey
Two row mixed-integer cuts via lifting. Math. Program. 124 (1-2) (2010)
Santanu S. Dey, Laurence A. Wolsey
Constrained Infinite Group Relaxations of MIPs. SIAM J. Optim. 20 (6) (2010)
Santanu S. Dey, Andrea Lodi, Andrea Tramontani, Laurence A. Wolsey
Experiments with Two Row Tableau Cuts. IPCO (2010)
Santanu S. Dey, Jean-Philippe P. Richard
Relations between facets of low- and high-dimensional group problems. Math. Program. 123 (2) (2010)
Santanu S. Dey, Jean-Philippe P. Richard
Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms. INFORMS J. Comput. 21 (1) (2009)
Santanu S. Dey, Jean-Philippe P. Richard
Facets of Two-Dimensional Infinite Group Problems. Math. Oper. Res. 33 (1) (2008)
Santanu S. Dey, Laurence A. Wolsey
Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles. IPCO (2008)
Santanu S. Dey, Jean-Philippe P. Richard
Sequential-Merge Facets for Two-Dimensional Group Problems. IPCO (2007)