default search action
Santanu Subhas Dey
Santanu S. Dey
Person information
- affiliation: Georgia Institute of Technology, Atlanta, GA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j72]Xiaoyi Gu, Santanu S. Dey
, Jean-Philippe P. Richard:
Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover Inequalities. INFORMS J. Comput. 36(3): 884-899 (2024) - [j71]Yijiang Li, Santanu S. Dey, Nikolaos V. Sahinidis:
A reformulation-enumeration MINLP algorithm for gas network design. J. Glob. Optim. 90(4): 931-963 (2024) - [j70]Santanu S. Dey, Yatharth Dubey
A theoretical and computational analysis of full strong-branching. Math. Program. 205(1): 303-336 (2024) - [j69]Grigoriy Blekherman, Santanu S. Dey
Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity. SIAM J. Optim. 34(1): 98-126 (2024) - [c12]Diego Cifuentes, Santanu S. Dey, Jingye Xu:
Sensitivity Analysis for Mixed Binary Quadratic Programming. IPCO 2024: 446-459 - 2023
- [j68]Santanu S. Dey, Mohit Singh, David P. Williamson:
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2021. Math. Program. 197(2): 449-450 (2023) - [j67]Xiaoyi Gu, Santanu S. Dey
Lifting convex inequalities for bipartite bilinear programs. Math. Program. 197(2): 587-619 (2023) - [j66]Santanu S. Dey, Yatharth Dubey
Lower bounds on the size of general branch-and-bound trees. Math. Program. 198(1): 539-559 (2023) - [j65]Santanu S. Dey
Solving sparse principal component analysis with global support. Math. Program. 199(1): 421-459 (2023) - [j64]Santanu S. Dey, Yatharth Dubey
Branch-and-bound solves random binary IPs in poly(n)-time. Math. Program. 200(1): 569-587 (2023) - 2022
- [j63]Santanu S. Dey, Burak Kocuk
Node-based valid inequalities for the optimal transmission switching problem. Discret. Optim. 43: 100683 (2022) - [j62]Digvijay Boob
Complexity of training ReLU neural network. Discret. Optim. 44(Part): 100620 (2022) - [j61]Emma Savannah Johnson
A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid. INFORMS J. Comput. 34(4): 2296-2312 (2022) - [j60]Santanu S. Dey
Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA. Oper. Res. 70(3): 1914-1932 (2022) - [j59]Grigoriy Blekherman
Sparse PSD approximation of the PSD cone. Math. Program. 191(2): 981-1004 (2022) - [j58]Santanu S. Dey, James R. Luedtke, Nikolaos V. Sahinidis:
Special Issue: Global Solution of Integer, Stochastic and Nonconvex Optimization Problems. Math. Program. 196(1): 1-8 (2022) - [j57]Santanu S. Dey
Lower bound on size of branch-and-bound trees for solving lot-sizing problem. Oper. Res. Lett. 50(5): 430-433 (2022) - [j56]Grigoriy Blekherman
Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices. SIAM J. Optim. 32(2): 470-490 (2022) - [j55]Santanu S. Dey
On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations. SIAM J. Optim. 32(2): 659-686 (2022) - [j54]Santanu S. Dey
Cutting Plane Generation through Sparse Principal Component Analysis. SIAM J. Optim. 32(2): 1319-1343 (2022) - [e1]Ivana Ljubic
Combinatorial Optimization - 7th International Symposium, ISCO 2022, Virtual Event, May 18-20, 2022, Revised Selected Papers. Lecture Notes in Computer Science 13526, Springer 2022, ISBN 978-3-031-18529-8 [contents] - 2021
- [c11]Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard
Lifting Convex Inequalities for Bipartite Bilinear Programs. IPCO 2021: 148-162 - [c10]Santanu S. Dey, Yatharth Dubey, Marco Molinaro:
Branch-and-Bound Solves Random Binary IPs in Polytime. SODA 2021: 579-591 - [i6]Santanu S. Dey, Yatharth Dubey, Marco Molinaro:
Lower Bounds on the Size of General Branch-and-Bound Trees. CoRR abs/2103.09807 (2021) - 2020
- [j53]Kevin Ryan
Optimization-Driven Scenario Grouping. INFORMS J. Comput. 32(3): 805-821 (2020) - [j52]Santanu S. Dey
Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem. J. Glob. Optim. 77(2): 227-272 (2020) - [j51]Xiaoyi Gu
Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming. SIAM J. Optim. 30(1): 781-797 (2020) - [j50]Alberto Del Pia
Subset Selection in Sparse Matrices. SIAM J. Optim. 30(2): 1173-1190 (2020) - [j49]Asteroide Santana, Santanu S. Dey
The Convex Hull of a Quadratic Constraint over a Polytope. SIAM J. Optim. 30(4): 2983-2997 (2020) - [j48]Santanu S. Dey, Guanyi Wang, Yao Xie
Approximation Algorithms for Training One-Node ReLU Neural Networks. IEEE Trans. Signal Process. 68: 6696-6706 (2020) - [c9]Guanyi Wang, Santanu S. Dey:
Upper bounds for Model-Free Row-Sparse Principal Component Analysis. ICML 2020: 9868-9875 - [i5]Santanu S. Dey, Yatharth Dubey, Marco Molinaro:
Branch-and-Bound Solves Random Binary Packing IPs in Polytime. CoRR abs/2007.15192 (2020)
2010 – 2019
- 2019
- [j47]Amitabh Basu
Nonunique Lifting of Integer Variables in Minimal Inequalities. SIAM J. Discret. Math. 33(2): 755-783 (2019) - [j46]Merve Bodur
Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs. SIAM J. Optim. 29(1): 55-76 (2019) - 2018
- [j45]Joey Huchette
Strong mixed-integer formulations for the floor layout problem. INFOR Inf. Syst. Oper. Res. 56(4): 392-433 (2018) - [j44]Joey Huchette
Beating the SDP bound for the floor layout problem: a simple combinatorial idea. INFOR Inf. Syst. Oper. Res. 56(4): 457-481 (2018) - [j43]Santanu S. Dey
Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs. Math. Oper. Res. 43(1): 304-332 (2018) - [j42]Santanu S. Dey
Theoretical challenges towards cutting-plane selection. Math. Program. 170(1): 237-266 (2018) - [j41]Merve Bodur
Aggregation-based cutting-planes for packing and covering integer programs. Math. Program. 171(1-2): 331-359 (2018) - [j40]Burak Kocuk
Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem. Math. Program. Comput. 10(4): 557-596 (2018) - [j39]Santanu S. Dey
The strength of multi-row aggregation cuts for sign-pattern integer programs. Oper. Res. Lett. 46(6): 611-615 (2018) - [j38]Santanu S. Dey
Improving the Randomization Step in Feasibility Pump. SIAM J. Optim. 28(1): 355-378 (2018) - [i4]Digvijay Boob, Santanu S. Dey, Guanghui Lan:
Complexity of Training ReLU Neural Network. CoRR abs/1809.10787 (2018) - [i3]Alberto Del Pia, Santanu S. Dey, Robert Weismantel:
Subset selection in sparse matrices. CoRR abs/1810.02757 (2018) - 2017
- [j37]Asteroide Santana, Santanu S. Dey
Some cut-generating functions for second-order conic sets. Discret. Optim. 24: 51-65 (2017) - [j36]Akshay Gupte
Relaxations and discretizations for the pooling problem. J. Glob. Optim. 67(3): 631-669 (2017) - [j35]Alberto Del Pia
Mixed-integer quadratic programming is in NP. Math. Program. 162(1-2): 225-240 (2017) - [j34]Natashia Boland
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions. Math. Program. 162(1-2): 523-535 (2017) - 2016
- [j33]Feng Qiu
Strengthened bounds for the probability of k-out-of-n events. Discret. Appl. Math. 198: 232-240 (2016) - [j32]Gustavo Angulo
Improving the Integer L-Shaped Method. INFORMS J. Comput. 28(3): 483-499 (2016) - [j31]Burak Kocuk
A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching. Oper. Res. 64(4): 922-938 (2016) - [j30]Burak Kocuk
Strong SOCP Relaxations for the Optimal Power Flow Problem. Oper. Res. 64(6): 1177-1196 (2016) - [j29]Matthias Walter
On a cardinality-constrained transportation problem with market choice. Oper. Res. Lett. 44(2): 170-173 (2016) - [j28]Diego A. Morán R., Santanu S. Dey
Closedness of Integer Hulls of Simple Conic Sets. SIAM J. Discret. Math. 30(1): 70-99 (2016) - 2015
- [j27]Pelin Damci-Kurt, Santanu S. Dey
On the transportation problem with market choice. Discret. Appl. Math. 181: 54-77 (2015) - [j26]Santanu S. Dey
Analysis of MILP Techniques for the Pooling Problem. Oper. Res. 63(2): 412-427 (2015) - [j25]Gustavo Angulo
Forbidden Vertices. Math. Oper. Res. 40(2): 350-360 (2015) - [j24]Santanu S. Dey
Approximating polyhedra with sparse inequalities. Math. Program. 154(1-2): 329-352 (2015) - [j23]Santanu S. Dey
Some lower bounds on sparse outer approximations of polytopes. Oper. Res. Lett. 43(3): 323-328 (2015) - 2014
- [j22]Santanu S. Dey
On the Practical Strength of Two-Row Tableau Cuts. INFORMS J. Comput. 26(2): 222-237 (2014) - [j21]Feng Qiu
Covering Linear Programming with Violations. INFORMS J. Comput. 26(3): 531-546 (2014) - [j20]Santanu S. Dey
Design and verify: a new scheme for generating cutting-planes. Math. Program. 145(1-2): 199-222 (2014) - [j19]Daniel Dadush
On the Chvátal-Gomory closure of a compact convex set. Math. Program. 145(1-2): 327-348 (2014) - [j18]Gustavo Angulo
Semi-continuous network flow problems. Math. Program. 145(1-2): 565-599 (2014) - [c8]Santanu S. Dey
How Good Are Sparse Cutting-Planes? IPCO 2014: 261-272 - [i2]Alberto Del Pia, Santanu S. Dey, Marco Molinaro:
Mixed-integer Quadratic Programming is in NP. CoRR abs/1407.4798 (2014) - [i1]Pelin Damci-Kurt, Santanu S. Dey, Simge Küçükyavuz:
On a Cardinality-Constrained Transportation Problem With Market Choice. CoRR abs/1412.8723 (2014) - 2013
- [j17]Santanu S. Dey
Some properties of convex hulls of integer points contained in general convex sets. Math. Program. 141(1-2): 507-526 (2013) - [j16]Akshay Gupte
Solving Mixed Integer Bilinear Problems Using MILP Formulations. SIAM J. Optim. 23(2): 721-744 (2013) - [c7]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: 266-277 - 2012
- [j15]Sanjeeb Dash, Santanu S. Dey
Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra. Math. Program. 135(1-2): 221-254 (2012) - [j14]Diego A. Morán R., Santanu S. Dey
A Strong Dual for Conic Mixed-Integer Programs. SIAM J. Optim. 22(3): 1136-1150 (2012) - 2011
- [j13]Daniel Dadush
The Chvátal-Gomory Closure of a Strictly Convex Body. Math. Oper. Res. 36(2): 227-239 (2011) - [j12]Santanu S. Dey
Split Rank of Triangle and Quadrilateral Inequalities. Math. Oper. Res. 36(3): 432-461 (2011) - [j11]Santanu S. Dey
A note on the split rank of intersection cuts. Math. Program. 130(1): 107-124 (2011) - [j10]Daniel Dadush
The split closure of a strictly convex body. Oper. Res. Lett. 39(2): 121-126 (2011) - [j9]Sanjeeb Dash, Santanu S. Dey
On mixed-integer sets with two integer variables. Oper. Res. Lett. 39(5): 305-309 (2011) - [j8]Diego A. Morán R., Santanu S. Dey
On Maximal S-Free Convex Sets. SIAM J. Discret. Math. 25(1): 379-393 (2011) - [c6]Daniel Dadush
On the Chvátal-Gomory Closure of a Compact Convex Set. IPCO 2011: 130-142 - [c5]Santanu S. Dey
Design and Verify: A New Scheme for Generating Cutting-Planes. IPCO 2011: 143-155 - 2010
- [j7]Santanu S. Dey
Composite lifting of group inequalities and an application to two-row mixing inequalities. Discret. Optim. 7(4): 256-268 (2010) - [j6]Santanu S. Dey
On the extreme inequalities of infinite group problems. Math. Program. 121(1): 145-170 (2010) - [j5]Santanu S. Dey
Relations between facets of low- and high-dimensional group problems. Math. Program. 123(2): 285-313 (2010) - [j4]Santanu S. Dey
Two row mixed-integer cuts via lifting. Math. Program. 124(1-2): 143-174 (2010) - [j3]Santanu S. Dey
Constrained Infinite Group Relaxations of MIPs. SIAM J. Optim. 20(6): 2890-2912 (2010) - [c4]Santanu S. Dey
The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron. IPCO 2010: 327-340 - [c3]Santanu S. Dey
Experiments with Two Row Tableau Cuts. IPCO 2010: 424-437 - [p1]Jean-Philippe P. Richard
The Group-Theoretic Approach in Mixed Integer Programming. 50 Years of Integer Programming 2010: 727-801
2000 – 2009
- 2009
- [j2]Santanu S. Dey
Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms. INFORMS J. Comput. 21(1): 137-150 (2009) - 2008
- [j1]Santanu S. Dey
Facets of Two-Dimensional Infinite Group Problems. Math. Oper. Res. 33(1): 140-166 (2008) - [c2]Santanu S. Dey
Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles. IPCO 2008: 463-475 - 2007
- [c1]Santanu S. Dey
Sequential-Merge Facets for Two-Dimensional Group Problems. IPCO 2007: 30-42
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-14 00:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: