Oktay Gunluk joined the School of Operations Research and Information Engineering faculty in January 2020. Before joining Cornell, he was the manager of the Mathematical Optimization and Algorithms group at IBM Research. He has also spent three years as a researcher in the Operations Research group in AT&T Labs. At both of these industrial labs, in addition to basic research in mathematical optimization, he has worked on various large-scale applied optimization projects for internal and external customers.
Professor Gunluk's main research interests are related to theoretical and computational aspects of discrete optimization problems, mainly in the area of integer programming. In particular, his main body of work is in the area of cutting planes for mixed-integer sets. Some of his recent work focuses on developing integer programming-based approaches to classification problems in machine learning.
In Spring 2020, Professor Gunluk is teaching ORIE 6336, a graduate level course on integer programming. In Fall 2019, he taught ORF 522 at Princeton University that covers linear optimization for graduate students.
Oktay Gunluk is currently serving, or has recently served on the editorial boards of Networks, Math. Programming Computation, Operations Research, Math of Operations Research, Optimization and Engineering, and MOS/SIAM Book Series on Optimization. He has served in the program committee of IPCO several times, has chaired the organizing committee in 2011 and he is currently serving in the steering committee. He has recently chaired the INFORMS Optimization Society Young Researcher's Prize Committee and currently serves in the Khachiyan Prize Committee. He has also been involved in organizing the Mixed Integer Programming workshop series.
- Binary extended formulations of polyhedral mixed-integer sets, with Dash and Hildebrand, Math. Programming, 170(1), 207--236 (2018).
- Solving Box-Constrained Nonconvex Quadratic Programs, with Bonami and Linderoth, Math. Programming Computation, 10(3), 333--382 (2018).
- On the polyhedrality of closures of multi-branch split sets and other polyhedra with bounded max-facet-width, with Dash and Moran, SIAM J. Optimization 27-3,1340-1361 (2017).
- Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse, with Bodur, Dash and Luedtke, Informs J. on Computing, 29(1), pp. 77–91 (2017).
- Lattice-free sets, branching disjunctions, and mixed-integer programming, with Dash, Dobbs, Nowicki,and Swirszcz, Math. Programming, 145, 483--508 (2014).
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables, with Linderoth, Math. Programming, 124, 183--205 (2010).
- Robust Capacity Planning in Semiconductor Manufacturing, with Barahona, Bermon and Hood, Naval Research Logistics, 51, 258--274 (2004).
- Mixing Mixed-Integer Inequalities, with Pochet, Math. Programming, 90, 429-457 (2001).
B.S./M.S. (Industrial Engineering), Bogazici University 1987/1989
M.S./Ph.D. (Operations Research), Columbia University 1993/1995