Santanu S. Dey

97 papers A* 2B 11C 1Journal 82

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