Information-based branching schemes for binary linear mixed integer problems F Kılınç Karzan, GL Nemhauser, MWP Savelsbergh Mathematical Programming Computation 1 (4), 249-293, 2009 | 77 | 2009 |
Faster algorithms for extensive-form game solving via improved smoothing functions C Kroer, K Waugh, F Kılınç-Karzan, T Sandholm Mathematical Programming 179 (1), 385-417, 2020 | 65 | 2020 |
A Second-Order Cone Based Approach for Solving the Trust Region Subproblem and Its Variants N Ho-Nguyen, F Kılınç-Karzan SIAM Journal on Optimization 27 (3), 1485–1512, 2016 | 63 | 2016 |
On Minimal Valid Inequalities for Mixed Integer Conic Programs F Kılınç Karzan Mathematics of Operations Research 41 (2), 477 - 510, 2013 | 61 | 2013 |
On the tightness of SDP relaxations of QCQPs AL Wang, F Kılınç-Karzan Mathematical Programming 193, 33-73, 2022 | 60 | 2022 |
Faster First-Order Methods for Extensive-Form Game Solving C Kroer, K Waugh, F Kılınç-Karzan, T Sandholm Proceedings of the Sixteenth ACM Conference on Economics and Computation (EC …, 2015 | 53 | 2015 |
Distributionally Robust Chance-Constrained Programs with Right-Hand Side Uncertainty under Wasserstein Ambiguity N Ho-Nguyen, F Kılınç-Karzan, S Küçükyavuz, D Lee Mathematical Programming 196, 641-672, 2022 | 49 | 2022 |
How to Convexify the Intersection of a Second Order Cone and a Nonconvex Quadratic S Burer, F Kılınç-Karzan Mathematical Programming 162 (1), 393-429, 2017 | 49 | 2017 |
Two-term disjunctions on the second-order cone F Kln-Karzan, S Yldz Lecture Notes in Computer Science 8494, 345-356, 2015 | 48* | 2015 |
Two-term disjunctions on the second-order cone F Kılınç-Karzan, S Yıldız Mathematical Programming 154 (1), 463-491, 2015 | 45 | 2015 |
Exploiting problem structure in optimization under uncertainty via online convex optimization N Ho-Nguyen, F Kılınç-Karzan Mathematical Programming 177 (1-2), 113-147, 2019 | 36* | 2019 |
Online First-Order Framework for Robust Convex Optimization N Ho-Nguyen, F Kılınç-Karzan Operations Research 66 (6), 1670 - 1692, 2018 | 35 | 2018 |
The generalized trust region subproblem: solution complexity and convex hull results AL Wang, F Kılınç-Karzan Mathematical Programming 191 (2), 445-486, 2022 | 30 | 2022 |
Theoretical and Practical Advances on Smoothing for Extensive-Form Games C Kroer, K Waugh, F Kılınç-Karzan, T Sandholm Proceedings of the 18th ACM Conference on Economics and Computation (EC'17 …, 2017 | 30 | 2017 |
Verifiable conditions of ℓ 1-recovery for sparse signals with sign restrictions A Juditsky, F Kılınç-Karzan, A Nemirovski Mathematical programming 127 (1), 89-122, 2011 | 30 | 2011 |
Risk Guarantees for End-to-End Prediction and Optimization Processes N Ho-Nguyen, F Kılınç-Karzan Management Science 66 (12), 8515-9218, 2022 | 28 | 2022 |
Rebounding bandits for modeling satiation effects L Leqi, F Kilinc Karzan, Z Lipton, A Montgomery Advances in Neural Information Processing Systems 34, 4003-4014, 2021 | 28 | 2021 |
Randomized first order algorithms with applications to ℓ1-minimization A Juditsky, FK Karzan, A Nemirovski Mathematical Programming 142 (1-2), 269-310, 2013 | 28* | 2013 |
Accuracy guaranties for recovery of block-sparse signals A Juditsky, FK Karzan, A Nemirovski, B Polyak The Annals of Statistics 40 (6), 3077-3107, 2012 | 28 | 2012 |
Two-term disjunctions on the second-order cone F Kılınç-Karzan, S Yıldız International Conference on Integer Programming and Combinatorial …, 2014 | 26 | 2014 |