Recovering Dantzig-Wolfe Bounds by Cutting Planes. - Chen, Rui; Günlük, Oktay; Lodi, Andrea (Oper. Res., 2025)

Robust-to-Dynamics Optimization. - Ahmadi, Amir Ali; Günlük, Oktay (Math. Oper. Res., 2025)

Binary Matrix Factorization and Completion via Integer Programming. - Günlük, Oktay; Hauser, Raphael Andreas; Kovács, Réka Ágnes (Math. Oper. Res., 2024)

Fair Minimum Representation Clustering. - Lawless, Connor; Günlük, Oktay (2024)

Warehouse Problem with Multiple Vendors and Generalized Complementarity Constraints. - Bansal, Ishan; Günlük, Oktay (CoRR, 2024)

Fair Minimum Representation Clustering via Integer Programming. - Lawless, Connor; Günlük, Oktay (CoRR, 2024)

Parallel Token Swapping for Qubit Routing. - Bansal, Ishan; Günlük, Oktay; Shapley, Richard (CoRR, 2024)

Multilinear sets with two monomials and cardinality constraints. - Chen, Rui; Dash, Sanjeeb; Günlük, Oktay (Discret. Appl. Math., 2023)

Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions. - Chen, Rui; Dash, Sanjeeb; Günlük, Oktay (Discret. Optim., 2023)

Interpretable and Fair Boolean Rule Sets via Column Generation. - Lawless, Connor; Dash, Sanjeeb; Günlük, Oktay; Wei, Dennis (J. Mach. Learn. Res., 2023)

Special Issue: International Symposium on Mathematical Programming 2022. - Davis, Damek Shea; Günlük, Oktay; Kaibel, Volker; Nannicini, Giacomo; Yuan, Xa-Xiang (Math. Program., 2023)

Cluster Explanation via Polyhedral Descriptions. - Lawless, Connor; Günlük, Oktay (2023)

Fair Minimum Representation Clustering. - Lawless, Connor; Günlük, Oktay (CoRR, 2023)

Warehouse Problem with Bounds, Fixed Costs and Complementarity Constraints. - Bansal, Ishan; Günlük, Oktay (CoRR, 2023)

On a generalization of the Chvátal-Gomory closure. - Dash, Sanjeeb; Günlük, Oktay; Lee, Dabeen (Math. Program., 2022)

Cluster Explanation via Polyhedral Descriptions. - Lawless, Connor; Günlük, Oktay (CoRR, 2022)

A Simple Algorithm for Online Decision Making. - Chen, Rui; Günlük, Oktay; Lodi, Andrea; Wang, Guanyi (CoRR, 2022)

Optimal decision trees for categorical data via integer programming. - Günlük, Oktay; Kalagnanam, Jayant; Li, Minhan; Menickelly, Matt; Scheinberg, Katya (J. Glob. Optim., 2021)

Generalized Chvátal-Gomory closures for integer programs with bounds on variables. - Dash, Sanjeeb; Günlük, Oktay; Lee, Dabeen (Math. Program., 2021)

Binary Matrix Factorisation via Column Generation. - Kovács, Réka Á.; Günlük, Oktay; Hauser, Raphael A. (2021)

Binary Matrix Factorisation and Completion via Integer Programming. - Kovács, Réka Á.; Günlük, Oktay; Hauser, Raphael A. (CoRR, 2021)

Fair Decision Rules for Binary Classification. - Lawless, Connor; Günlük, Oktay (CoRR, 2021)

Interpretable and Fair Boolean Rule Sets via Column Generation. - Lawless, Connor; Dash, Sanjeeb; Günlük, Oktay; Wei, Dennis (CoRR, 2021)

Lattice closures of polyhedra. - Dash, Sanjeeb; Günlük, Oktay; R., Diego A. Morán (Math. Program., 2020)

On a Generalization of the Chvátal-Gomory Closure. - Dash, Sanjeeb; Günlük, Oktay; Lee, Dabeen (2020)

Cardinality Constrained Multilinear Sets. - Chen, Rui; Dash, Sanjeeb; Günlük, Oktay (2020)

Multilabel Classification by Hierarchical Partitioning and Data-dependent Grouping. - Ubaru, Shashanka; Dash, Sanjeeb; Mazumdar, Arya; Günlük, Oktay (2020)

Combinatorial Optimization - 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4-6, 2020, Revised Selected Papers (Springer, 2020)

Multilabel Classification by Hierarchical Partitioning and Data-dependent Grouping. - Ubaru, Shashanka; Dash, Sanjeeb; Mazumdar, Arya; Günlük, Oktay (CoRR, 2020)

Binary Matrix Factorisation via Column Generation. - Kovács, Réka Á.; Günlük, Oktay; Hauser, Raphael A. (CoRR, 2020)

Generalized Linear Rule Models. - Wei, Dennis; Dash, Sanjeeb; Gao, Tian; Günlük, Oktay (2019)

Generalized Linear Rule Models. - Wei, Dennis; Dash, Sanjeeb; Gao, Tian; Günlük, Oktay (CoRR, 2019)

Binary extended formulations of polyhedral mixed-integer sets. - Dash, Sanjeeb; Günlük, Oktay; Hildebrand, Robert (Math. Program., 2018)

Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods. - Bonami, Pierre; Günlük, Oktay; Linderoth, Jeff T. (Math. Program. Comput., 2018)

A note on capacity models for network design. - Atamtürk, Alper; Günlük, Oktay (Oper. Res. Lett., 2018)

Boolean Decision Rules via Column Generation. - Dash, Sanjeeb; Günlük, Oktay; Wei, Dennis (2018)

Low-Rank Boolean Matrix Approximation by Integer Programming. - Kovács, Réka; Günlük, Oktay; Hauser, Raphael A. (CoRR, 2018)

Robust-to-Dynamics Optimization. - Ahmadi, Amir Ali; Günlük, Oktay (CoRR, 2018)

Boolean Decision Rules via Column Generation. - Dash, Sanjeeb; Günlük, Oktay; Wei, Dennis (CoRR, 2018)

A new lift-and-project operator. - Bodur, Merve; Dash, Sanjeeb; Günlük, Oktay (Eur. J. Oper. Res., 2017)

Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse. - Bodur, Merve; Dash, Sanjeeb; Günlük, Oktay; Luedtke, James R. (INFORMS J. Comput., 2017)

Cutting planes from extended LP formulations. - Bodur, Merve; Dash, Sanjeeb; Günlük, Oktay (Math. Program., 2017)

On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width. - Dash, Sanjeeb; Günlük, Oktay; R., Diego A. Morán (SIAM J. Optim., 2017)

The continuous knapsack set. - Dash, Sanjeeb; Günlük, Oktay; Wolsey, Laurence A. (Math. Program., 2016)

On the polyhedrality of cross and quadrilateral closures. - Dash, Sanjeeb; Günlük, Oktay; R., Diego A. Morán (Math. Program., 2016)

Optimal Generalized Decision Trees via Integer Programming. - Menickelly, Matt; Günlük, Oktay; Kalagnanam, Jayant; Scheinberg, Katya (CoRR, 2016)

Discretization vertex orders in distance geometry. - Cassioli, Andrea; Günlük, Oktay; Lavor, Carlile; Liberti, Leo (Discret. Appl. Math., 2015)

On the relative strength of different generalizations of split cuts. - Dash, Sanjeeb; Günlük, Oktay; Molinaro, Marco (Discret. Optim., 2015)

Robust-to-dynamics linear programming. - Ahmadi, Amir Ali; Günlük, Oktay (2015)

Computational Experiments with Cross and Crooked Cross Cuts. - Dash, Sanjeeb; Günlük, Oktay; Vielma, Juan Pablo (INFORMS J. Comput., 2014)

Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming. - Dash, Sanjeeb; Dobbs, Neil B.; Günlük, Oktay; Nowicki, Tomasz; Swirszcz, Grzegorz (Math. Program., 2014)

Robust confidentiality preserving data delivery in federated coalition networks. - Su, Lu; Gao, Yunlong; Ye, Fan; Liu, Peng; Günlük, Oktay; Bcrman, Tom; Calo, Seraphin B.; Abdelzaher, Tarek F. (2014)

On t-branch split cuts for mixed-integer programs. - Dash, Sanjeeb; Günlük, Oktay (Math. Program., 2013)

On Some Generalizations of the Split Closure. - Dash, Sanjeeb; Günlük, Oktay; Ramírez, Diego Alejandro Morán (2013)

A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows. - Dash, Sanjeeb; Günlük, Oktay; Lodi, Andrea; Tramontani, Andrea (INFORMS J. Comput., 2012)

The master equality polyhedron with multiple rows. - Dash, Sanjeeb; Fukasawa, Ricardo; Günlük, Oktay (Math. Program., 2012)

Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra. - Dash, Sanjeeb; Dey, Santanu S.; Günlük, Oktay (Math. Program., 2012)

Strengthening lattice-free cuts using non-negativity. - Fukasawa, Ricardo; Günlük, Oktay (Discret. Optim., 2011)

A note on the MIR closure and basic relaxations of polyhedra. - Dash, Sanjeeb; Günlük, Oktay; Raack, Christian (Oper. Res. Lett., 2011)

On mixed-integer sets with two integer variables. - Dash, Sanjeeb; Dey, Santanu S.; Günlük, Oktay (Oper. Res. Lett., 2011)

Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings (Springer, 2011)

Two-Step MIR Inequalities for Mixed Integer Programs. - Dash, Sanjeeb; Goycoolea, Marcos; Günlük, Oktay (INFORMS J. Comput., 2010)

MIR closures of polyhedral sets. - Dash, Sanjeeb; Günlük, Oktay; Lodi, Andrea (Math. Program., 2010)

Mingling: mixed-integer rounding with bounds. - Atamtürk, Alper; Günlük, Oktay (Math. Program., 2010)

Erratum to: MIR closures of polyhedral sets. - Dash, Sanjeeb; Günlük, Oktay; Lodi, Andrea (Math. Program., 2010)

Perspective reformulations of mixed integer nonlinear programs with indicator variables. - Günlük, Oktay; Linderoth, Jeff T. (Math. Program., 2010)

On a generalization of the master cyclic group polyhedron. - Dash, Sanjeeb; Fukasawa, Ricardo; Günlük, Oktay (Math. Program., 2010)

A model for fusion and code motion in an automatic parallelizing compiler. - Bondhugula, Uday; Günlük, Oktay; Dash, Sanjeeb; Renganarayanan, Lakshminarayanan (2010)

On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs. - Dash, Sanjeeb; Günlük, Oktay (SIAM J. Optim., 2009)

A pricing problem under Monge property. - Günlük, Oktay (Discret. Optim., 2008)

On the strength of Gomory mixed-integer cuts as group cuts. - Dash, Sanjeeb; Günlük, Oktay (Math. Program., 2008)

Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables. - Günlük, Oktay; Linderoth, Jeff T. (2008)

Network design arc set with variable upper bounds. - Atamtürk, Alper; Günlük, Oktay (Networks, 2007)

A New Min-Cut Max-Flow Ratio for Multicommodity Flows. - Günlük, Oktay (SIAM J. Discret. Math., 2007)

On a Generalization of the Master Cyclic Group Polyhedron. - Dash, Sanjeeb; Fukasawa, Ricardo; Günlük, Oktay (2007)

On the MIR Closure of Polyhedra. - Dash, Sanjeeb; Günlük, Oktay; Lodi, Andrea (2007)

Valid inequalities based on simple mixed-integer sets. - Dash, Sanjeeb; Günlük, Oktay (Math. Program., 2006)

Valid inequalities based on the interpolation procedure. - Dash, Sanjeeb; Günlük, Oktay (Math. Program., 2006)

Vehicle Routing and Staffing for Sedan Service. - Günlük, Oktay; Kimbrel, Tracy; Ladányi, Laszlo; Schieber, Baruch; Sorkin, Gregory B. (Transp. Sci., 2006)

A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions. - Günlük, Oktay; Ladányi, Laszlo; Vries, Sven de (Manag. Sci., 2005)

Valid Inequalities Based on Simple Mixed-Integer Sets. - Dash, Sanjeeb; Günlük, Oktay (2004)

A New Min-Cut Max-Flow Ratio for Multicommodity Flows. - Günlük, Oktay (2002)

Mixing mixed-integer inequalities. - Günlük, Oktay; Pochet, Yves (Math. Program., 2001)

The multicast packing problem. - Chen, Shiwen; Günlük, Oktay; Yener, Bülent (IEEE/ACM Trans. Netw., 2000)

A branch-and-cut algorithm for capacitated network design problems. - Günlük, Oktay (Math. Program., 1999)

Minimum cost capacity installation for multicommodity network flows. - Bienstock, Daniel; Chopra, Sunil; Günlük, Oktay; Tsai, Chih-Yang (Math. Program., 1998)

Optimal Packing of Group Multi-Casting. - Chen, Shiwen; Günlük, Oktay; Yener, Bülent (1998)

Capacitated Network Design - Polyhedral Structure and Computation. - Bienstock, Daniel; Günlük, Oktay (INFORMS J. Comput., 1996)

Computational experience with a difficult mixed-integer multicommodity flow problem. - Bienstock, Daniel; Günlük, Oktay (Math. Program., 1995)

A degree sequence problem related to network design. - Bienstock, Daniel; Günlük, Oktay (Networks, 1994)