Oktay Günlük

Gary C. Butler Family Professor

Contact

 Groseclose 420
 Personal website
 Curriculum Vitae
  Contact
  • Oktay Gunluk Google Scholar

Education

  • Ph.D. Operations Research , Columbia University
  • M.Phil. Operations Research , Columbia University
  • M.S. Industrial Engineering , Boğaziçi University
  • B.S. Industrial Engineering , Boğaziçi University

About

Oktay Günlük is a Gary C. Butler Family Professor in the H. Milton Stewart School of Industrial and Systems Engineering at Georgia Tech. Prior to joining Georgia Tech he was a professor of practice in the School of Operations Research and Information Engineering at Cornell University and 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. 

Research

Prof. Günlük'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. In addition, some of his current research work includes (1) developing integer programming-based approaches to classification and clustering problems in machine learning, and (2) qubit assignment and routing for quantum computers.

He currently serves as the Editor-in-Chief of Informs Journal on Optimization.

Teaching

Prof. Günlük'steaching interests are related to theoretical and computational aspects of mathematical optimization, mainly in the area of integer programming. He has taught undergraduate level optimization classes including linear, integer, and combinatorial optimization.

Representative Publications

  • ``Parallel Token Swapping for Qubit Routing'', with Ishan Bansal and Richard Shapley, Discrete Applied Math, 377: 480-497 (2025).
  • ``Robust-to-Dynamics Optimization", with A. Ahmadi, Math of OR, 50(2), 965-992 (2025).
  • ``Recovering Dantzig-Wolfe Bounds by Cutting Planes'', with Rui Chen and Andrea Lodi, Operations Research, 73(2): 1128--1142 (2025).
  • ``Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions", with Rui Chen and Dash, Discrete Optimization, 50: 100804 (2023)
  • ``Binary matrix factorisation and completion via integer programming", with Hauser and Kovacs, Math. of OR, 49(2): 1278--1302 (2024).
  • ``Interpretable and Fair Boolean Rule Sets via Column Generation", with Lawless, Dash, and Wei, Journal of Machine Learning Research, 24,1-50 (2023).
  • ``Multilinear Sets with Two Monomials and Cardinality Constraints", with Rui Chen and Dash, Discrete Applied Mathematics, 324, 67--79 (2023).
  • ``Optimal qubit assignment and routing via integer programming", with Nannicini, Bishop and Jurcevic, ACM Transactions on Quantum Computing, 4(1), 1--31 (2023)
  • ``On a generalization of the Chvatal-Gomory closure", with Dash and Dabeen Lee, Math. Programming, 192 (1), 149--175 (2022).
  • ``Optimal decision trees for categorical data via integer programming" (with  Kalagnanam, Li, Menickelly, and Scheinberg), Journal of Global Optimization, 81, 233-–260 (2021).
  • ``Demonstration of quantum volume 64 on a superconducting quantum computing system", Jurcevic, Javadi-Abhari, Bishop, Lauer, et. al., Quantum Science and Technology, 6 (2), 025020 (2021).
  • ``Generalized Chvatal-Gomory closures for integer programs" with S. Dash and D. Lee, Math. Programming, 190 (1), 393--425 (2021).
  • ``Lattice closures of polyhedra" (with S. Dash and D. Moran), Math. Programming, 182(1), 119--147 (2020).