Strong SOCP relaxations for the optimal power flow problem B Kocuk, SS Dey, XA Sun Operations Research 64 (6), 1177-1196, 2016 | 370 | 2016 |
Solving mixed integer bilinear problems using MILP formulations A Gupte, S Ahmed, MS Cheon, S Dey SIAM Journal on Optimization 23 (2), 721-744, 2013 | 225 | 2013 |
Inexactness of SDP relaxation and valid inequalities for optimal power flow B Kocuk, SS Dey, XA Sun IEEE Transactions on Power Systems 31 (1), 642-651, 2015 | 158 | 2015 |
New formulation and strong MISOCP relaxations for AC optimal transmission switching problem B Kocuk, SS Dey, XA Sun IEEE Transactions on Power Systems 32 (6), 4161-4170, 2017 | 150 | 2017 |
Mixed-integer quadratic programming is in NP AD Pia, SS Dey, M Molinaro Mathematical Programming 162, 225-240, 2017 | 136 | 2017 |
Improving the integer L-shaped method G Angulo, S Ahmed, SS Dey INFORMS Journal on Computing 28 (3), 483-499, 2016 | 126 | 2016 |
Two row mixed-integer cuts via lifting SS Dey, LA Wolsey Mathematical Programming 124, 143-174, 2010 | 83 | 2010 |
Complexity of training ReLU neural network D Boob, SS Dey, G Lan Discrete Optimization 44, 100620, 2022 | 81 | 2022 |
Pooling problems: relaxations and discretizations A Gupte, S Ahmed, SS Dey, MS Cheon School of Industrial and Systems Engineering, Georgia Institute of …, 2013 | 78* | 2013 |
Covering linear programming with violations F Qiu, S Ahmed, SS Dey, LA Wolsey INFORMS Journal on Computing 26 (3), 531-546, 2014 | 77 | 2014 |
Lifting integer variables in minimal inequalities corresponding to lattice-free triangles SS Dey, LA Wolsey Integer Programming and Combinatorial Optimization: 13th International …, 2008 | 77 | 2008 |
Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem B Kocuk, SS Dey, XA Sun Mathematical Programming Computation 10 (4), 557-596, 2018 | 75 | 2018 |
A cycle-based formulation and valid inequalities for DC power transmission problems with switching B Kocuk, H Jeon, SS Dey, J Linderoth, J Luedtke, XA Sun Operations Research 64 (4), 922-938, 2016 | 74 | 2016 |
Constrained infinite group relaxations of MIPs SS Dey, LA Wolsey SIAM Journal on Optimization 20 (6), 2890-2912, 2010 | 72 | 2010 |
Analysis of MILP techniques for the pooling problem SS Dey, A Gupte Operations Research 63 (2), 412-427, 2015 | 69 | 2015 |
Theoretical challenges towards cutting-plane selection SS Dey, M Molinaro Mathematical Programming 170, 237-266, 2018 | 60 | 2018 |
The split closure of a strictly convex body D Dadush, SS Dey, JP Vielma Operations Research Letters 39 (2), 121-126, 2011 | 59 | 2011 |
On the extreme inequalities of infinite group problems SS Dey, JPP Richard, Y Li, LA Miller Mathematical Programming 121, 145-170, 2010 | 58 | 2010 |
Using -Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA SS Dey, R Mazumder, G Wang Operations Research 70 (3), 1914-1932, 2022 | 43* | 2022 |
Forbidden vertices G Angulo, S Ahmed, SS Dey, V Kaibel Mathematics of Operations Research 40 (2), 350-360, 2015 | 42 | 2015 |