Santanu S. Dey, Ph.D.
Affiliations: | 2007 | Industrial Engineering | Purdue University, West Lafayette, IN, United States |
Area:
Operations Research, Industrial EngineeringGoogle:
"Santanu Dey"Parents
Sign in to add mentorJean-Philippe P. Richard | grad student | 2007 | Purdue | |
(Strong cutting planes for unstructured mixed integer programs using multiple constraints.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Ryan K, Ahmed S, Dey SS, et al. (2020) Optimization-Driven Scenario Grouping Informs Journal On Computing. 32: 805-821 |
Gu X, Ahmed S, Dey SS. (2020) Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming Siam Journal On Optimization. 30: 781-797 |
Pia AD, Dey SS, Weismantel R. (2020) Subset Selection in Sparse Matrices Siam Journal On Optimization. 30: 1173-1190 |
Dey SS, Kocuk B, Santana A. (2020) Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem Journal of Global Optimization. 77: 227-272 |
Bodur M, Pia AD, Dey SS, et al. (2019) Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs Siam Journal On Optimization. 29: 55-76 |
Basu A, Dey SS, Paat J. (2019) Nonunique Lifting of Integer Variables in Minimal Inequalities Siam Journal On Discrete Mathematics. 33: 755-783 |
Dey SS, Santana A, Wang Y. (2019) New SOCP relaxation and branching rule for bipartite bilinear programs Optimization and Engineering. 20: 307-336 |
Dey SS, Iroume A, Molinaro M, et al. (2018) Improving the Randomization Step in Feasibility Pump Siam Journal On Optimization. 28: 355-378 |
Huchette J, Dey SS, Vielma JP. (2018) Beating the SDP bound for the floor layout problem: A simple combinatorial idea Infor. 56: 457-481 |
Huchette J, Dey SS, Vielma JP. (2018) Strong mixed-integer formulations for the floor layout problem Infor. 56: 392-433 |