| JPEG compression history estimation for color images R Neelamani, R De Queiroz, Z Fan, S Dash, RG Baraniuk IEEE Transactions on Image Processing 15 (6), 1365-1378, 2006 | 170 | 2006 |
| Solution of a min-max vehicle routing problem D Applegate, W Cook, S Dash, A Rohe INFORMS Journal on computing 14 (2), 132-143, 2002 | 136 | 2002 |
| Exact solutions to linear programming problems DL Applegate, W Cook, S Dash, DG Espinoza Operations Research Letters 35 (6), 693-699, 2007 | 130 | 2007 |
| A time bucket formulation for the traveling salesman problem with time windows S Dash, O Günlük, A Lodi, A Tramontani INFORMS Journal on Computing 24 (1), 132-147, 2012 | 96 | 2012 |
| On the matrix-cut rank of polyhedra W Cook, S Dash Mathematics of Operations Research 26 (1), 19-30, 2001 | 90 | 2001 |
| A model for fusion and code motion in an automatic parallelizing compiler U Bondhugula, S Dash, O Gunluk, L Renganarayanan 2010 19th International Conference on Parallel Architectures and Compilation …, 2010 | 79 | 2010 |
| MIR closures of polyhedral sets S Dash, O Günlük, A Lodi Mathematical Programming 121 (1), 33-60, 2010 | 79 | 2010 |
| Valid inequalities based on simple mixed-integer sets S Dash, O Günlük Mathematical Programming 105 (1), 29-53, 2006 | 77 | 2006 |
| Boolean decision rules via column generation S Dash, O Günlük, D Wei arXiv preprint arXiv:1805.09901, 2018 | 64 | 2018 |
| Strengthened benders cuts for stochastic integer programs with continuous recourse M Bodur, S Dash, O Günlük, J Luedtke INFORMS Journal on Computing 29 (1), 77-91, 2017 | 64 | 2017 |
| Projected Chvátal–Gomory cuts for mixed integer linear programs P Bonami, G Cornuéjols, S Dash, M Fischetti, A Lodi Mathematical Programming 113 (2), 241-257, 2008 | 53 | 2008 |
| An exponential lower bound on the length of some classes of branch-and-cut proofs S Dash International Conference on Integer Programming and Combinatorial …, 2002 | 45 | 2002 |
| Numerically safe Gomory mixed-integer cuts W Cook, S Dash, R Fukasawa, M Goycoolea INFORMS Journal on Computing 21 (4), 641-649, 2009 | 36 | 2009 |
| Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra S Dash, SS Dey, O Günlük Mathematical programming 135 (1), 221-254, 2012 | 34 | 2012 |
| On the MIR closure of polyhedra S Dash, O Günlük, A Lodi International Conference on Integer Programming and Combinatorial …, 2007 | 31 | 2007 |
| Optimization over structured subsets of positive semidefinite matrices via column generation AA Ahmadi, S Dash, G Hall Discrete Optimization 24, 129-151, 2017 | 30 | 2017 |
| Two-step MIR inequalities for mixed integer programs S Dash, M Goycoolea, O Günlük INFORMS Journal on Computing 22 (2), 236-249, 2010 | 30 | 2010 |
| Valid inequalities based on the interpolation procedure S Dash, O Günlük Mathematical Programming 106 (1), 111-136, 2006 | 30 | 2006 |
| Production design for plate products in the steel industry S Dash, J Kalagnanam, C Reddy, SH Song IBM journal of research and development 51 (3.4), 345-362, 2007 | 28 | 2007 |
| On the strength of Gomory mixed-integer cuts as group cuts S Dash, O Günlük Mathematical Programming 115 (2), 387-407, 2008 | 27 | 2008 |
