Oktay Günlük

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 41

Top Topics

Integer Program

Matrix Factorisation

Integer Programming

Top Venues

INFORMS J. Comput.

Discret. Optim.

Publications

Ishan Bansal, Oktay Günlük
Warehouse Problem with Multiple Vendors and Generalized Complementarity Constraints. CoRR (2024)
Connor Lawless, Oktay Günlük
Fair Minimum Representation Clustering. CPAIOR (2) (2024)
Oktay Günlük, Raphael Andreas Hauser, Réka Ágnes Kovács
Binary Matrix Factorization and Completion via Integer Programming. Math. Oper. Res. 49 (2) (2024)
Damek Shea Davis, Oktay Günlük, Volker Kaibel, Giacomo Nannicini, Xa-Xiang Yuan
Special Issue: International Symposium on Mathematical Programming 2022. Math. Program. 200 (2) (2023)
Rui Chen, Sanjeeb Dash, Oktay Günlük
Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions. Discret. Optim. 50 (2023)
Connor Lawless, Sanjeeb Dash, Oktay Günlük, Dennis Wei
Interpretable and Fair Boolean Rule Sets via Column Generation. J. Mach. Learn. Res. 24 (2023)
Rui Chen, Sanjeeb Dash, Oktay Günlük
Multilinear sets with two monomials and cardinality constraints. Discret. Appl. Math. 324 (2023)
Ishan Bansal, Oktay Günlük
Warehouse Problem with Bounds, Fixed Costs and Complementarity Constraints. CoRR (2023)
Connor Lawless, Oktay Günlük
Cluster Explanation via Polyhedral Descriptions. ICML (2023)
Connor Lawless, Oktay Günlük
Fair Minimum Representation Clustering. CoRR (2023)
Sanjeeb Dash, Oktay Günlük, Dabeen Lee
On a generalization of the Chvátal-Gomory closure. Math. Program. 192 (1) (2022)
Rui Chen, Oktay Günlük, Andrea Lodi, Guanyi Wang
A Simple Algorithm for Online Decision Making. CoRR (2022)
Connor Lawless, Oktay Günlük
Cluster Explanation via Polyhedral Descriptions. CoRR (2022)
Sanjeeb Dash, Oktay Günlük, Dabeen Lee
Generalized Chvátal-Gomory closures for integer programs with bounds on variables. Math. Program. 190 (1) (2021)
Connor Lawless, Sanjeeb Dash, Oktay Günlük, Dennis Wei
Interpretable and Fair Boolean Rule Sets via Column Generation. CoRR (2021)
Reka A. Kovacs, Oktay Günlük, Raphael A. Hauser
Binary Matrix Factorisation and Completion via Integer Programming. CoRR (2021)
Connor Lawless, Oktay Günlük
Fair Decision Rules for Binary Classification. CoRR (2021)
Oktay Günlük, Jayant Kalagnanam, Minhan Li, Matt Menickelly, Katya Scheinberg
Optimal decision trees for categorical data via integer programming. J. Glob. Optim. 81 (1) (2021)
Reka A. Kovacs, Oktay Günlük, Raphael A. Hauser
Binary Matrix Factorisation via Column Generation. AAAI (2021)
Sanjeeb Dash, Oktay Günlük, Dabeen Lee
On a Generalization of the Chvátal-Gomory Closure. IPCO (2020)
Sanjeeb Dash, Oktay Günlük, Diego A. Morán R.
Lattice closures of polyhedra. Math. Program. 181 (1) (2020)
Shashanka Ubaru, Sanjeeb Dash, Arya Mazumdar, Oktay Günlük
Multilabel Classification by Hierarchical Partitioning and Data-dependent Grouping. NeurIPS (2020)
Reka A. Kovacs, Oktay Günlük, Raphael A. Hauser
Binary Matrix Factorisation via Column Generation. CoRR (2020)
Shashanka Ubaru, Sanjeeb Dash, Arya Mazumdar, Oktay Günlük
Multilabel Classification by Hierarchical Partitioning and Data-dependent Grouping. CoRR (2020)
Rui Chen, Sanjeeb Dash, Oktay Günlük
Cardinality Constrained Multilinear Sets. ISCO (2020)
Dennis Wei, Sanjeeb Dash, Tian Gao, Oktay Günlük
Generalized Linear Rule Models. ICML (2019)
Dennis Wei, Sanjeeb Dash, Tian Gao, Oktay Günlük
Generalized Linear Rule Models. CoRR (2019)
Sanjeeb Dash, Oktay Günlük, Robert Hildebrand
Binary extended formulations of polyhedral mixed-integer sets. Math. Program. 170 (1) (2018)
Amir Ali Ahmadi, Oktay Günlük
Robust-to-Dynamics Optimization. CoRR (2018)
Reka Kovacs, Oktay Günlük, Raphael A. Hauser
Low-Rank Boolean Matrix Approximation by Integer Programming. CoRR (2018)
Pierre Bonami, Oktay Günlük, Jeff T. Linderoth
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods. Math. Program. Comput. 10 (3) (2018)
Alper Atamtürk, Oktay Günlük
A note on capacity models for network design. Oper. Res. Lett. 46 (4) (2018)
Sanjeeb Dash, Oktay Günlük, Dennis Wei
Boolean Decision Rules via Column Generation. NeurIPS (2018)
Sanjeeb Dash, Oktay Günlük, Dennis Wei
Boolean Decision Rules via Column Generation. CoRR (2018)
Sanjeeb Dash, Oktay Günlük, Diego A. Morán R.
On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width. SIAM J. Optim. 27 (3) (2017)
Merve Bodur, Sanjeeb Dash, Oktay Günlük
Cutting planes from extended LP formulations. Math. Program. 161 (1-2) (2017)
Merve Bodur, Sanjeeb Dash, Oktay Günlük, James R. Luedtke
Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse. INFORMS J. Comput. 29 (1) (2017)
Merve Bodur, Sanjeeb Dash, Oktay Günlük
A new lift-and-project operator. Eur. J. Oper. Res. 257 (2) (2017)
Matt Menickelly, Oktay Günlük, Jayant Kalagnanam, Katya Scheinberg
Optimal Generalized Decision Trees via Integer Programming. CoRR (2016)
Sanjeeb Dash, Oktay Günlük, Laurence A. Wolsey
The continuous knapsack set. Math. Program. 155 (1-2) (2016)
Sanjeeb Dash, Oktay Günlük, Diego A. Morán R.
On the polyhedrality of cross and quadrilateral closures. Math. Program. 160 (1-2) (2016)
Sanjeeb Dash, Oktay Günlük, Marco Molinaro
On the relative strength of different generalizations of split cuts. Discret. Optim. 16 (2015)
Amir Ali Ahmadi, Oktay Günlük
Robust-to-dynamics linear programming. CDC (2015)
Andrea Cassioli, Oktay Günlük, Carlile Lavor, Leo Liberti
Discretization vertex orders in distance geometry. Discret. Appl. Math. 197 (2015)
Sanjeeb Dash, Oktay Günlük, Juan Pablo Vielma
Computational Experiments with Cross and Crooked Cross Cuts. INFORMS J. Comput. 26 (4) (2014)
Lu Su, Yunlong Gao, Fan Ye, Peng Liu, Oktay Günlük, Tom Bcrman, Seraphin B. Calo, Tarek F. Abdelzaher
Robust confidentiality preserving data delivery in federated coalition networks. Networking (2014)
Sanjeeb Dash, Neil B. Dobbs, Oktay Günlük, Tomasz Nowicki, Grzegorz Swirszcz
Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming. Math. Program. 145 (1-2) (2014)
Sanjeeb Dash, Oktay Günlük
On t-branch split cuts for mixed-integer programs. Math. Program. 141 (1-2) (2013)
Sanjeeb Dash, Oktay Günlük, Diego Alejandro Morán Ramírez
On Some Generalizations of the Split Closure. IPCO (2013)
Sanjeeb Dash, Oktay Günlük, Andrea Lodi, Andrea Tramontani
A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows. INFORMS J. Comput. 24 (1) (2012)
Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük
The master equality polyhedron with multiple rows. Math. Program. 132 (1-2) (2012)
Sanjeeb Dash, Santanu S. Dey, Oktay Günlük
Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra. Math. Program. 135 (1-2) (2012)
Ricardo Fukasawa, Oktay Günlük
Strengthening lattice-free cuts using non-negativity. Discret. Optim. 8 (2) (2011)
Sanjeeb Dash, Oktay Günlük, Christian Raack
A note on the MIR closure and basic relaxations of polyhedra. Oper. Res. Lett. 39 (3) (2011)
Sanjeeb Dash, Santanu S. Dey, Oktay Günlük
On mixed-integer sets with two integer variables. Oper. Res. Lett. 39 (5) (2011)
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
MIR closures of polyhedral sets. Math. Program. 121 (1) (2010)
Uday Bondhugula, Oktay Günlük, Sanjeeb Dash, Lakshminarayanan Renganarayanan
A model for fusion and code motion in an automatic parallelizing compiler. PACT (2010)
Sanjeeb Dash, Marcos Goycoolea, Oktay Günlük
Two-Step MIR Inequalities for Mixed Integer Programs. INFORMS J. Comput. 22 (2) (2010)
Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük
On a generalization of the master cyclic group polyhedron. Math. Program. 125 (1) (2010)
Oktay Günlük, Jeff T. Linderoth
Perspective reformulations of mixed integer nonlinear programs with indicator variables. Math. Program. 124 (1-2) (2010)
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
Erratum to: MIR closures of polyhedral sets. Math. Program. 123 (2) (2010)
Alper Atamtürk, Oktay Günlük
Mingling: mixed-integer rounding with bounds. Math. Program. 123 (2) (2010)
Sanjeeb Dash, Oktay Günlük
On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs. SIAM J. Optim. 20 (2) (2009)
Sanjeeb Dash, Oktay Günlük
On the strength of Gomory mixed-integer cuts as group cuts. Math. Program. 115 (2) (2008)
Oktay Günlük, Jeff T. Linderoth
Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables. IPCO (2008)
Oktay Günlük
A pricing problem under Monge property. Discret. Optim. 5 (2) (2008)
Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük
On a Generalization of the Master Cyclic Group Polyhedron. IPCO (2007)
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
On the MIR Closure of Polyhedra. IPCO (2007)
Oktay Günlük
A New Min-Cut Max-Flow Ratio for Multicommodity Flows. SIAM J. Discret. Math. 21 (1) (2007)
Alper Atamtürk, Oktay Günlük
Network design arc set with variable upper bounds. Networks 50 (1) (2007)
Sanjeeb Dash, Oktay Günlük
Valid inequalities based on simple mixed-integer sets. Math. Program. 105 (1) (2006)
Oktay Günlük, Tracy Kimbrel, Laszlo Ladányi, Baruch Schieber, Gregory B. Sorkin
Vehicle Routing and Staffing for Sedan Service. Transp. Sci. 40 (3) (2006)
Sanjeeb Dash, Oktay Günlük
Valid inequalities based on the interpolation procedure. Math. Program. 106 (1) (2006)
Oktay Günlük, Laszlo Ladányi, Sven de Vries
A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions. Manag. Sci. 51 (3) (2005)
Sanjeeb Dash, Oktay Günlük
Valid Inequalities Based on Simple Mixed-Integer Sets. IPCO (2004)
Oktay Günlük
A New Min-Cut Max-Flow Ratio for Multicommodity Flows. IPCO (2002)
Oktay Günlük, Yves Pochet
Mixing mixed-integer inequalities. Math. Program. 90 (3) (2001)
Shiwen Chen, Oktay Günlük, Bülent Yener
The multicast packing problem. IEEE/ACM Trans. Netw. 8 (3) (2000)
Oktay Günlük
A branch-and-cut algorithm for capacitated network design problems. Math. Program. 86 (1) (1999)
Shiwen Chen, Oktay Günlük, Bülent Yener
Optimal Packing of Group Multi-Casting. INFOCOM (1998)
Daniel Bienstock, Sunil Chopra, Oktay Günlük, Chih-Yang Tsai
Minimum cost capacity installation for multicommodity network flows. Math. Program. 81 (1998)
Daniel Bienstock, Oktay Günlük
Capacitated Network Design - Polyhedral Structure and Computation. INFORMS J. Comput. 8 (3) (1996)
Daniel Bienstock, Oktay Günlük
Computational experience with a difficult mixed-integer multicommodity flow problem. Math. Program. 68 (1995)
Daniel Bienstock, Oktay Günlük
A degree sequence problem related to network design. Networks 24 (4) (1994)