Sequential-Merge Facets for Two-Dimensional Group Problems. - Santanu S. Dey; Jean-Philippe P. Richard (IPCO, 2007)

Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles. - Santanu S. Dey; Laurence A. Wolsey (IPCO, 2008)

Facets of Two-Dimensional Infinite Group Problems. - Santanu S. Dey; Jean-Philippe P. Richard (Math. Oper. Res., 2008)

Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms. - Santanu S. Dey; Jean-Philippe P. Richard (INFORMS J. Comput., 2009)

The Group-Theoretic Approach in Mixed Integer Programming. - Jean-Philippe P. Richard; Santanu S. Dey (50 Years of Integer Programming, 2010)

Experiments with Two Row Tableau Cuts. - Santanu S. Dey; Andrea Lodi 001; Andrea Tramontani; Laurence A. Wolsey (IPCO, 2010)

The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron. - Santanu S. Dey; Juan Pablo Vielma (IPCO, 2010)

Composite lifting of group inequalities and an application to two-row mixing inequalities. - Santanu S. Dey; Laurence A. Wolsey (Discret. Optim., 2010)

Relations between facets of low- and high-dimensional group problems. - Santanu S. Dey; Jean-Philippe P. Richard (Math. Program., 2010)

On the extreme inequalities of infinite group problems. - Santanu S. Dey; Jean-Philippe P. Richard; Yanjun Li; Lisa A. Miller (Math. Program., 2010)

Two row mixed-integer cuts via lifting. - Santanu S. Dey; Laurence A. Wolsey (Math. Program., 2010)

Constrained Infinite Group Relaxations of MIPs. - Santanu S. Dey; Laurence A. Wolsey (SIAM J. Optim., 2010)

The Chvátal-Gomory Closure of a Strictly Convex Body. - Daniel Dadush; Santanu S. Dey; Juan Pablo Vielma (Math. Oper. Res., 2011)

Split Rank of Triangle and Quadrilateral Inequalities. - Santanu S. Dey; Quentin Louveaux (Math. Oper. Res., 2011)

A note on the split rank of intersection cuts. - Santanu S. Dey (Math. Program., 2011)

The split closure of a strictly convex body. - Daniel Dadush; Santanu S. Dey; Juan Pablo Vielma (Oper. Res. Lett., 2011)

On mixed-integer sets with two integer variables. - Sanjeeb Dash; Santanu S. Dey; Oktay Günlük (Oper. Res. Lett., 2011)

On Maximal S-Free Convex Sets. - Diego A. Morán R.; Santanu S. Dey (SIAM J. Discret. Math., 2011)

Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra. - Sanjeeb Dash; Santanu S. Dey; Oktay Günlük (Math. Program., 2012)

A Strong Dual for Conic Mixed-Integer Programs. - Diego A. Morán R.; Santanu S. Dey; Juan Pablo Vielma (SIAM J. Optim., 2012)

A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets. - Diego Alejandro Morán Ramírez; Santanu S. Dey (IPCO, 2013)

Some properties of convex hulls of integer points contained in general convex sets. - Santanu S. Dey; Diego A. Morán R. (Math. Program., 2013)

Solving Mixed Integer Bilinear Problems Using MILP Formulations. - Akshay Gupte; Shabbir Ahmed 001; Myun-Seok Cheon; Santanu S. Dey (SIAM J. Optim., 2013)

How Good Are Sparse Cutting-Planes? - Santanu S. Dey; Marco Molinaro 001; Qianyi Wang (IPCO, 2014)

On a Cardinality-Constrained Transportation Problem With Market Choice. - Pelin Damci-Kurt; Santanu S. Dey; Simge Küçükyavuz (CoRR, 2014)

On the Practical Strength of Two-Row Tableau Cuts. - Santanu S. Dey; Andrea Lodi 001; Andrea Tramontani; Laurence A. Wolsey (INFORMS J. Comput., 2014)

Covering Linear Programming with Violations. - Feng Qiu; Shabbir Ahmed 001; Santanu S. Dey; Laurence A. Wolsey (INFORMS J. Comput., 2014)

Semi-continuous network flow problems. - Gustavo Angulo; Shabbir Ahmed 001; Santanu S. Dey (Math. Program., 2014)

On the Chvátal-Gomory closure of a compact convex set. - Daniel Dadush; Santanu S. Dey; Juan Pablo Vielma (Math. Program., 2014)

Design and verify: a new scheme for generating cutting-planes. - Santanu S. Dey; Sebastian Pokutta (Math. Program., 2014)

On the transportation problem with market choice. - Pelin Damci-Kurt; Santanu S. Dey; Simge Küçükyavuz (Discret. Appl. Math., 2015)

Analysis of MILP Techniques for the Pooling Problem. - Santanu S. Dey; Akshay Gupte (Oper. Res., 2015)

Forbidden Vertices. - Gustavo Angulo; Shabbir Ahmed 001; Santanu S. Dey; Volker Kaibel (Math. Oper. Res., 2015)

Approximating polyhedra with sparse inequalities. - Santanu S. Dey; Marco Molinaro 001; Qianyi Wang (Math. Program., 2015)

Some lower bounds on sparse outer approximations of polytopes. - Santanu S. Dey; Andres Iroume; Marco Molinaro 001 (Oper. Res. Lett., 2015)

Strengthened bounds for the probability of k-out-of-n events. - Feng Qiu; Shabbir Ahmed 001; Santanu S. Dey (Discret. Appl. Math., 2016)

Improving the Integer L-Shaped Method. - Gustavo Angulo; Shabbir Ahmed 001; Santanu S. Dey (INFORMS J. Comput., 2016)

Strong SOCP Relaxations for the Optimal Power Flow Problem. - Burak Kocuk; Santanu S. Dey; Xu Andy Sun (Oper. Res., 2016)

A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching. - Burak Kocuk; Hyemin Jeon; Santanu S. Dey; Jeff T. Linderoth; James R. Luedtke; Xu Andy Sun (Oper. Res., 2016)

On a cardinality-constrained transportation problem with market choice. - Matthias Walter; Pelin Damci-Kurt; Santanu S. Dey; Simge Küçükyavuz (Oper. Res. Lett., 2016)

Closedness of Integer Hulls of Simple Conic Sets. - Diego A. Morán R.; Santanu S. Dey (SIAM J. Discret. Math., 2016)

Some cut-generating functions for second-order conic sets. - Asteroide Santana; Santanu S. Dey (Discret. Optim., 2017)

Relaxations and discretizations for the pooling problem. - Akshay Gupte; Shabbir Ahmed 001; Santanu S. Dey; Myun-Seok Cheon (J. Glob. Optim., 2017)

Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions. - Natashia Boland; Santanu S. Dey; Thomas Kalinowski; Marco Molinaro 001; Fabian Rigterink (Math. Program., 2017)

Mixed-integer quadratic programming is in NP. - Alberto Del Pia; Santanu S. Dey; Marco Molinaro 001 (Math. Program., 2017)

Strong mixed-integer formulations for the floor layout problem. - Joey Huchette; Santanu S. Dey; Juan Pablo Vielma (INFOR Inf. Syst. Oper. Res., 2018)

Beating the SDP bound for the floor layout problem: a simple combinatorial idea. - Joey Huchette; Santanu S. Dey; Juan Pablo Vielma (INFOR Inf. Syst. Oper. Res., 2018)

Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs. - Santanu S. Dey; Marco Molinaro 001; Qianyi Wang (Math. Oper. Res., 2018)

Aggregation-based cutting-planes for packing and covering integer programs. - Merve Bodur; Alberto Del Pia; Santanu S. Dey; Marco Molinaro 001; Sebastian Pokutta (Math. Program., 2018)

Theoretical challenges towards cutting-plane selection. - Santanu S. Dey; Marco Molinaro 001 (Math. Program., 2018)

Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem. - Burak Kocuk; Santanu S. Dey; Xu Andy Sun (Math. Program. Comput., 2018)

The strength of multi-row aggregation cuts for sign-pattern integer programs. - Santanu S. Dey; Andres Iroume; Guanyi Wang (Oper. Res. Lett., 2018)

Improving the Randomization Step in Feasibility Pump. - Santanu S. Dey; Andres Iroume; Marco Molinaro 001; Domenico Salvagnin (SIAM J. Optim., 2018)

Nonunique Lifting of Integer Variables in Minimal Inequalities. - Amitabh Basu; Santanu S. Dey; Joseph Paat (SIAM J. Discret. Math., 2019)

Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs. - Merve Bodur; Alberto Del Pia; Santanu S. Dey; Marco S. Molinaro 001 (SIAM J. Optim., 2019)

Upper bounds for Model-Free Row-Sparse Principal Component Analysis. - Guanyi Wang; Santanu S. Dey (ICML, 2020)

Branch-and-Bound Solves Random Binary Packing IPs in Polytime. - Santanu S. Dey; Yatharth Dubey; Marco Molinaro 001 (CoRR, 2020)

Optimization-Driven Scenario Grouping. - Kevin Ryan; Shabbir Ahmed 001; Santanu S. Dey; Deepak Rajan; Amelia Musselman; Jean-Paul Watson (INFORMS J. Comput., 2020)

Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem. - Santanu S. Dey; Burak Kocuk; Asteroide Santana (J. Glob. Optim., 2020)

Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming. - Xiaoyi Gu; Shabbir Ahmed 001; Santanu S. Dey (SIAM J. Optim., 2020)

Subset Selection in Sparse Matrices. - Alberto Del Pia; Santanu S. Dey; Robert Weismantel (SIAM J. Optim., 2020)

The Convex Hull of a Quadratic Constraint over a Polytope. - Asteroide Santana; Santanu S. Dey (SIAM J. Optim., 2020)

Approximation Algorithms for Training One-Node ReLU Neural Networks. - Santanu S. Dey; Guanyi Wang; Yao Xie 002 (IEEE Trans. Signal Process., 2020)

Branch-and-Bound Solves Random Binary IPs in Polytime. - Santanu S. Dey; Yatharth Dubey; Marco Molinaro 001 (SODA, 2021)

Complexity of training ReLU neural network. - Digvijay Boob; Santanu S. Dey; Guanghui Lan (Discret. Optim., 2022)

Node-based valid inequalities for the optimal transmission switching problem. - Santanu S. Dey; Burak Kocuk; Nicole Redder (Discret. Optim., 2022)

A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid. - Emma Savannah Johnson; Santanu S. Dey (INFORMS J. Comput., 2022)

Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA. - Santanu S. Dey; Rahul Mazumder; Guanyi Wang (Oper. Res., 2022)

Sparse PSD approximation of the PSD cone. - Grigoriy Blekherman; Santanu S. Dey; Marco Molinaro 001; Shengding Sun (Math. Program., 2022)

Special Issue: Global Solution of Integer, Stochastic and Nonconvex Optimization Problems. - Santanu S. Dey; James R. Luedtke; Nikolaos V. Sahinidis (Math. Program., 2022)

Lower bound on size of branch-and-bound trees for solving lot-sizing problem. - Santanu S. Dey; Prachi Shah (Oper. Res. Lett., 2022)

Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices. - Grigoriy Blekherman; Santanu S. Dey; Kevin Shu; Shengding Sun (SIAM J. Optim., 2022)

Cutting Plane Generation through Sparse Principal Component Analysis. - Santanu S. Dey; Aleksandr M. Kazachkov; Andrea Lodi 001; Gonzalo Muñoz 001 (SIAM J. Optim., 2022)

On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations. - Santanu S. Dey; Gonzalo Muñoz 001; Felipe Serrano 001 (SIAM J. Optim., 2022)

Branch-and-bound solves random binary IPs in poly(n)-time. - Santanu S. Dey; Yatharth Dubey; Marco Molinaro 001 (Math. Program., 2023)

Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2021. - Santanu S. Dey; Mohit Singh; David P. Williamson (Math. Program., 2023)

Lifting convex inequalities for bipartite bilinear programs. - Xiaoyi Gu; Santanu S. Dey; Jean-Philippe P. Richard (Math. Program., 2023)

Lower bounds on the size of general branch-and-bound trees. - Santanu S. Dey; Yatharth Dubey; Marco Molinaro 001 (Math. Program., 2023)

Solving sparse principal component analysis with global support. - Santanu S. Dey; Marco Molinaro 001; Guanyi Wang (Math. Program., 2023)

Sensitivity Analysis for Mixed Binary Quadratic Programming. - Diego Cifuentes; Santanu S. Dey; Jingye Xu (IPCO, 2024)

Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover Inequalities. - Xiaoyi Gu; Santanu S. Dey; Jean-Philippe P. Richard (INFORMS J. Comput., 2024)

Decomposable Formulation of Transmission Constraints for Decentralized Power Systems Optimization. - Álinson Santos Xavier; Santanu Subhas Dey; Feng Qiu (INFORMS J. Comput., 2024)

Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity. - Grigoriy Blekherman; Santanu S. Dey; Shengding Sun (SIAM J. Optim., 2024)

A theoretical and computational analysis of full strong-branching. - Santanu S. Dey; Yatharth Dubey; Marco Molinaro 001; Prachi Shah (Math. Program., 2024)

A reformulation-enumeration MINLP algorithm for gas network design. - Yijiang Li; Santanu S. Dey; Nikolaos V. Sahinidis (J. Glob. Optim., 2024)

Lagrangian Dual for Integer Optimization with Zero Duality Gap that Admits Decomposition. - Diego Cifuentes; Santanu S. Dey; Jingye Xu (IPCO, 2025)

Optimizing the design and operation of water networks: Two decomposition approaches. - Yijiang Li; Santanu S. Dey; Nikolaos V. Sahinidis; Naresh Susarla; Miguel A. Zamarripa; Markus Drouven (Comput. Chem. Eng., 2025)