| On mixing sets arising in chance-constrained programming S Küçükyavuz Mathematical programming 132 (1-2), 31-56, 2012 | 117 | 2012 |
| Lot sizing with inventory bounds and fixed costs: Polyhedral study and computation A Atamtürk, S Küçükyavuz Operations Research 53 (4), 711-730, 2005 | 82 | 2005 |
| Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs D Gade, S Küçükyavuz, S Sen Mathematical Programming 144 (1-2), 39-64, 2014 | 79 | 2014 |
| Decomposition algorithms for two-stage chance-constrained programs X Liu, S Küçükyavuz, J Luedtke Mathematical Programming 157 (1), 219-243, 2016 | 77 | 2016 |
| Chance-constrained binary packing problems Y Song, JR Luedtke, S Küçükyavuz INFORMS Journal on Computing 26 (4), 735-747, 2014 | 70 | 2014 |
| A Polyhedral Study of Production Ramping P Damcı-Kurt, S Küçükyavuz, D Rajan, A Atamtürk Mathematical Programming 158 (1), 175-205, 2016 | 63* | 2016 |
| Uncapacitated lot sizing with backlogging: the convex hull S Küçükyavuz, Y Pochet Mathematical Programming 118 (1), 151-175, 2009 | 62 | 2009 |
| An O (n2) algorithm for lot sizing with inventory bounds and fixed costs A Atamtürk, S Küçükyavuz Operations Research Letters 36 (3), 297-299, 2008 | 56 | 2008 |
| On stochastic lot-sizing problems with random lead times K Huang, S KüçüKyavuz Operations Research Letters 36 (3), 303-308, 2008 | 53 | 2008 |
| A branch-and-cut method for dynamic decision making under joint chance constraints M Zhang, S Küçükyavuz, S Goel Management Science 60 (5), 1317-1333, 2014 | 47 | 2014 |
| A polyhedral study of multiechelon lot sizing with intermediate demands M Zhang, S Küçükyavuz, H Yaman Operations Research 60 (4), 918-935, 2012 | 45 | 2012 |
| Finitely Convergent Decomposition Algorithms for Two-Stage Stochastic Pure Integer Programs M Zhang, S Küçükyavuz SIAM Journal on Optimization 24 (4), 1933-1951, 2014 | 39 | 2014 |
| A two-stage stochastic programming approach for influence maximization in social networks HH Wu, S Küçükyavuz Computational Optimization and Applications 69 (3), 563-595, 2018 | 31 | 2018 |
| An introduction to two-stage stochastic mixed-integer programming S Küçükyavuz, S Sen Leading Developments from INFORMS Communities, 1-27, 2017 | 31 | 2017 |
| Formulations for dynamic lot sizing with service levels D Gade, S Küçükyavuz Naval Research Logistics (NRL) 60 (2), 87-101, 2013 | 21 | 2013 |
| Branch-and-price-and-cut algorithms for solving the reliable h-paths problem AK Andreas, JC Smith, S Küçükyavuz Journal of Global Optimization 42 (4), 443-466, 2008 | 21 | 2008 |
| Method for assigning network resources to applications for optimizing performance goals J Drew, C Santos, S Kucukyavuz, D Beyer, X Zhu US Patent App. 10/856,222, 2006 | 21 | 2006 |
| Finite disjunctive programming characterizations for general mixed-integer linear programs B Chen, S Küçükyavuz, S Sen Operations Research 59 (1), 202-210, 2011 | 20 | 2011 |
| System and method for connectivity between hosts and devices S Kucukyavuz, T Shahoumian, D Beyer, JW Drew US Patent App. 11/517,878, 2008 | 18 | 2008 |
| Robust multicriteria risk-averse stochastic programming models X Liu, S Küçükyavuz, N Noyan Annals of Operations Research 261 (1-2), 233-254, 2018 | 17 | 2018 |
Alper AtamturkProfessor, UC BerkeleyVerified email at berkeley.edu
