PhD Students
Reka Agnes Kovacs (Oxford, 2023), Connor Lawless (Cornell, 2024), Ishan Bansal (Cornell, 2024)Working Papers
Warehouse Problem with Multiple Vendors and Generalized Complementarity Constraints, with Ishan Bansal, arXiv:2302.2401.10738 (2024)
Warehouse Problem with Bounds, Fixed Costs and Complementarity Constraints, with Ishan Bansal, arXiv:2302.12136 (2023).
Fair Decision Rules for Binary Classification with Connor Lawless, arXiv 2107.01325 (2021).
MINLP Strengthening for Separable Convex Quadratic Transportation-Cost UFL, with Lee and Weismantel, IBM technical report RC24213 (2007).
Journal Papers
A Simple Algorithm for Online Decision Making with Rui Chen, Lodi, and Guanyi Wang, submitted.
Recovering Dantzig-Wolfe Bounds by Cutting Planes, with Rui Chen, and Lodi, Operations Research, to appear.
Interpretable and Fair Boolean Rule Sets via Column Generation, with Lawless, Dash, and Wei, Journal of Machine Learning Research, 24,1-50 (2023).
Binary matrix factorisation and completion via integer programming with Hauser and Kovacs, Math of OR, to appear.
Optimal qubit assignment and routing via integer programming with Nannicini, Bishop and Jurcevic, ACM Transactions on Quantum Computing, 4(1), 1--31 (2023).
Multilinear Sets with Two Monomials and Cardinality Constraints with Rui Chen and Dash, Discrete Applied Math, 324, 67--79 (2023).
Demonstration of quantum volume 64 on a superconducting quantum computing system with Jurcevic, Javadi-Abhari, Bishop, Lauer, Bogorin, Brink, Capellut, Itoko, Kanazawa, Kandala, Keefe, Krsulich, Landers, Lewandowski, McClure, Nannicini, Narasgond, Nayfeh, Pritchett, Rothwell, Srinivasan, Sundaresan, Wang, Wei, Wood, Yau, Zhang, Dial, Chow, and Gambetta, Quantum Science and Technology, 6(2) 025020 (2021).
Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions with Rui Chen and Dash, Discrete Optimization, 50, 100804 (2023).
On a generalization of the Chvatal-Gomory closure with Dash and Dabeen Lee, Math. Programming, 192 (1), 149--175 (2022)
Generalized Chvatal-Gomory closures for integer programs with bounds on variables, with Dash and Dabeen Lee, Math. Programming, 190(1) 393--425 (2021).
Robust-to-Dynamics Optimization, with Ahmadi, Math. of OR, to appear.
Optimal decision trees for categorical data via integer programming, with Kalagnanam, Minhan Li, Menickelly, and Scheinberg, Journal of Global Optimization, 81(1), 233-260 (2021).
Binary extended formulations of polyhedral mixed-integer sets, with Dash and Hildebrand, Math. Programming, 170(1), 207--236 (2018).
On capacity models for network design, with Atamturk, OR Letters, 46, 414–417 (2018).
Lattice closures of polyhedra, with Dash and Moran, Math. Programming, 182(1), 119-147 (2020).
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).
Solving Box-Constrained Nonconvex Quadratic Programs, with Bonami and Linderoth, Math. Programming Computation, 10(3), 333--382 (2018).
A new lift-and-project operator, with Bodur and Dash, EJOR, 257(2), 420-428 (2017).
Cutting planes derived from extended LP formulations, with Bodur and Dash, Math. Programming, 161(1-2), 159-192 (2017).
On the polyhedrality of cross and quadrilateral closures, with Dash and Moran, Math. Programming, 160(1), 245-270 (2016).
Discretization vertex orders in distance geometry, with Cassioli, Lavor and Liberti, Discrete Applied Mathematics, 197-C, 27--41 (2015).
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).
The continuous knapsack set, with Dash and Wolsey, Math. Programming, 155, 471--496 (2016).
On the Relative Strength of Different Generalizations of Split Cuts, with Dash and Molinaro, Discrete Optimization, 16, 36--50 (2015).
On t-branch split cuts for mixed-integer programs, with Dash, Math. Programming, 141, 591–599, (2013).
Lattice-free sets, branching disjunctions, and mixed-integer programming, with Dash, Dobbs, Nowicki,and Swirszcz, Math. Programming, 145, 483--508 (2014).
Computational Experiments with Cross and Crooked Cross Cuts, with Dash and Vielma, Informs J. on Computing, 26, 780--797 (2014).
A note on the MIR closure and basic relaxations of polyhedra, with Dash and Raack, OR Letters, 39, 198--199 (2011)
On mixed-integer sets with two integer variables, with Dash and Dey, OR Letters, 39, 305--309 (2011)
Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra, with Dash and Dey, Math. Programming, 135, 221-254 (2012).
A Time Bucket Formulation for the TSP with Time Windows, with Dash, Lodi and Tramontani, Informs J. on Computing, 24, 132-147 (2012).
Strengthening lattice-free cuts using non-negativity, with Fukasawa, Discrete Optimization 8, 229--245 (2011)
The master equality polyhedron with multiple rows, with Dash and Fukasawa, in Math. Programming, 132, 125--151 (2012)
On mixing inequalities: rank, closure and cutting plane proofs, with Dash, SIAM J. on Optimization 20, 1090--1109 (2009)
Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables, with Linderoth, Math. Programming, 124, 183--205 (2010).
Mingling: Mixed-Integer Rounding with Bounds, with Atamturk, Math. Programming, 123, 315--338 (2010).
MIR Closures of Polyhedral Sets, with Dash and Lodi, Math. Programming, 121, 33-60 (2010).
On a Generalization of the Master Cyclic Group Polyhedron, with Dash and Fukasawa, Math. Programming, 125, 1--30 (2010).
On the strength of Gomory mixed-integer cuts as group cuts, with Dash, Math. Programming, 115, 387--407 (2008).
Two step MIR inequalities for mixed-integer programs, with Dash and Goycoolea, Informs J. on Computing, 22, 236--249 (2010).
A pricing problem under Monge property, Discrete Optimization, 5, 328--336, 2008.
Network Design Arc Set with Variable Upper Bounds, with Atamturk, Networks 50, 17--28, (2007).
Vehicle Routing and Staffing for Sedan Service, with Kimbrel, Ladanyi, Schieber and Sorkin, Transportation Science, 40, 313--326 (2006).
Valid Inequalities Based on the Interpolation Procedure, with Dash, Math. Programming, 106, 111--136 (2006).
Valid Inequalities Based on Simple Mixed-integer Sets, with Dash, Math. Programming, 105, 29--53 (2006).
A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions, with Ladanyi and de Vries, Management Science, 51, 391---406 (2005).
Reformulating LPs with Transport. Const. -- App. to Workforce Scheduling, with Cezik, Naval Research Logistics, 51, 258--274 (2004).
Robust Capacity Planning in Semiconductor Manufacturing, with Barahona, Bermon and Hood, Naval Research Logistics, 51, 258--274 (2004).
A New Min-Cut Max-Flow Ratio for Multicommodity Flows, SIAM J. of Disc. Math., 21, pp. 1--15 (2007).
Mixing Mixed-Integer Inequalities, with Pochet, Math. Programming, 90, 429-457 (2001).
An Integer Programming Model for the Weekly Tour Scheduling Problem, with Cezik and Luss, Naval Research Logistics, 48, 607--624 (2001).
A Branch-and-Cut Algorithm for Capacitated Network Design Problems, Math. Programming, 86, 17-39 (1999).
The Multicast Packing Problem, with Chen and Yener, IEEE Transactions on Networking, 8, 311-318 (2000).
Designing Private Line Networks - Polyhedral Analysis and Computation, with Brockmuller and Wolsey, CORE - DP 96-47. (a shorter version appeared in Transactions on Operational Research, 16, 7-24 (2004))
Minimum Cost Capacity Installation for Multicommodity Network Flows, with Bienstock, Chopra and Tsai, Math. Programming, 81, 177-199 (1998).
Capacitated Network Design - Polyhedral Structure and Computation, with Bienstock, Informs J. on Computing, 8, 243-259, (1996). (pdf)
Computational Experience with a Difficult Multicommodity Flow Problem, with Bienstock, Math. Programming, 68, 213-238 (1995).
A Degree Sequence Problem Related to Network Design, with Bienstock, Networks, 24, 195-205 (1994).
Maintenance of a Device with Age-Dependent Exponential Failures, with Ozekici, Naval Research Logistics, 39, 699-714 (1992).
Book Chapters
Multi-commodity multi-facility network design, with Atamturk, in Network Design with Applications to Transportation and Logistics, edited by Crainic, Gendreau and Gendron, Springer, 2021.
Perspective Reformulation and Applications, with Linderoth, in MINLP, IMA Volumes in Math. and Its Applications, vol 154, edited by Lee and Leyffer, Springer, 2012.
A Polytope for a Product of Real Linear Functions in 0/1 Variables, with Lee and Leung, in MINLP, IMA Volumes in Math. and Its Applications, vol 154, edited by Lee and Leyffer, Springer, 2012. (Original version appeared as IBM technical report, 2003).
Conference Papers
Fair Minimum Representation Clustering with Connor Lawless, CPAIOR 2024.
Cluster Explanation via Polyhedral Descriptions, with Lawless, ICML 2023.
Binary Matrix Factorization via Column Generation, with Hauser and Kovacs, AAAI 2021.
Multilabel Classification by Hierarchical Partitioning and Data-dependent Grouping, with Ubaru, Dash, and Mazumdar, NeurIPS 2020.
Cardinality Constrained Multilinear Sets, with Dash and Rui Chen, ISCO 2020.
On a generalization of the Chvatal-Gomory closure, with Dash and Dabeen Lee, IPCO 2020.
Generalized Linear Rule Models, with Dash, Wei, and Gao, ICML 2019.
Boolean Decision Rules via Column Generation, with Dash and Wei, NeurIPS 2018 (spotlight talk).
Robust-to-dynamics linear programming, with Ahmadi, CDC 2015.
Robust confidentiality preserving data delivery in federated coalition networks, with Su, Gao, Ye, Liu, Berman, Calo, Abdelzaher, IFIP Networking 2014.
On Some Generalizations of the Split Closure, with Dash and Moran, IPCO 2013.
A Model for Fusion and Code Motion in an Integrated Auto-Parallelizing Compiler, with Bondhugula, Dash, and Renganarayana, PACT 2010.
Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables, with Linderoth, IPCO 2008.
On a Generalization of the Master Cyclic Group Polyhedron, with Dash and Fukasawa, IPCO 2007.
On the MIR Closure of Polyhedra, with Dash and Lodi, IPCO 2007.
Valid Inequalities Based on Simple Mixed-Integer Sets, with Dash, IPCO 2004.
A New Min-Cut Max-Flow Ratio for Multicommodity Flows, IPCO 2002.
Design Methodology for an Optical Mesh Network, with Klincewicz, ITCom 2002.
A parallel branch-and-cut algorithm for capacitated network design problems, Performance 1999.
Optimal Packing of Group Multicasting, Chen and Yener, Infocom 1998.
Workshop Papers
Fair and Interpretable Decision Rules for Binary Classification, with Connor Lawless, NeurIPS Workshop on Optimization for Machine Learning 2020.
Multilabel prediction in log time and data-dependent grouping, Multilabel prediction in log time and data-dependent grouping, with Ubaru and Dash, NeurIPS Workshop on Information Theory and Machine Learning 2019
Low-Rank Boolean Matrix Approximation by Integer Programming, with Hauser and Kovacs, NIPS Workshop on Optimization for Machine Learning 2017.
Globally Optimal Symbolic Regression, with Austel, Dash, Horesh, Liberti, Nannicini and Schieber, NIPS Symposium on Interpretable Machine Learning 2017.
Conference Proceedings
Combinatorial Optimization, Proceedings of ISCO 2020, with Baiou, Gendron, and Mahjoub, LNCS 12176, Springer 2020, ISBN 978-3-030-53261-1.
IPCO XV Proceedings, with Gerhard Woeginger, LNCS 6655, Springer 2011, ISBN 978-3-642-20806-5.
Ph.D. Thesis
Computational Problems in Telecommunication Networks (also in .ps)
Short Bio
Oktay Günlük is a professor of practice at Cornell University, School of ORIE. 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.
Oktay 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. Some of his recent work focuses on developing integer programming based approaches to classification and clustering problems in machine learning.
He holds B.S. and M.S. degrees from Boğaziçi University and a Ph.D. degree from Columbia University.
