| Capacitated network design—polyhedral structure and computation D Bienstock, O Günlük Informs journal on Computing 8 (3), 243-259, 1996 | 282 | 1996 |
| Minimum cost capacity installation for multicommodity network flows D Bienstock, S Chopra, O Günlük, CY Tsai Mathematical programming 81 (2), 177-199, 1998 | 278 | 1998 |
| Mixing mixed-integer inequalities O Günlük, Y Pochet Mathematical Programming 90 (3), 429-457, 2001 | 195 | 2001 |
| A branch-and-cut algorithm for capacitated network design problems O Günlük Mathematical programming 86 (1), 17-39, 1999 | 179 | 1999 |
| Robust capacity planning in semiconductor manufacturing F Barahona, S Bermon, O Günlük, S Hood Naval Research Logistics (NRL) 52 (5), 459-468, 2005 | 167 | 2005 |
| Perspective reformulations of mixed integer nonlinear programs with indicator variables O Günlük, J Linderoth Mathematical programming 124 (1-2), 183-205, 2010 | 151 | 2010 |
| Computational experience with a difficult mixedinteger multicommodity flow problem D Bienstock, O Günlük Mathematical Programming 68 (1-3), 213-237, 1995 | 126 | 1995 |
| 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 | 93 | 2012 |
| The multicast packing problem S Chen, O Gunluk, B Yener IEEE/ACM Transactions on networking 8 (3), 311-318, 2000 | 90 | 2000 |
| Valid inequalities based on simple mixed-integer sets S Dash, O Günlük Mathematical Programming 105 (1), 29-53, 2006 | 78 | 2006 |
| Perspective reformulation and applications O Günlük, J Linderoth Mixed Integer Nonlinear Programming, 61-89, 2012 | 77 | 2012 |
| MIR closures of polyhedral sets S Dash, O Günlük, A Lodi Mathematical Programming 121 (1), 33-60, 2010 | 77 | 2010 |
| 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 | 73 | 2010 |
| 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 | 57 | 2017 |
| Designing private line networks B Brockmüller, O Günlük, L Wolsey Transactions on Operational Research 16 (1), 7, 2004 | 57* | 2004 |
| Perspective relaxation of mixed integer nonlinear programs with indicator variables O Günlük, J Linderoth International Conference on Integer Programming and Combinatorial …, 2008 | 55 | 2008 |
| A branch-and-price algorithm and new test problems for spectrum auctions O Günlük, L Ladányi, S De Vries Management Science 51 (3), 391-406, 2005 | 55 | 2005 |
| An integer programming model for the weekly tour scheduling problem T Cezik, O Günlük, H Luss Naval Research Logistics (NRL) 48 (7), 607-624, 2001 | 53 | 2001 |
| MINLP strengthening for separable convex quadratic transportation-cost UFL O Günlük, J Lee, R Weismantel IBM Res. Report, 1-16, 2007 | 50 | 2007 |
| Discretization vertex orders in distance geometry A Cassioli, O Günlük, C Lavor, L Liberti Discrete Applied Mathematics 197, 27-41, 2015 | 48 | 2015 |
Sanjeeb DashIBM ResearchVerified email at us.ibm.com
