Oktay Günlük

According to our database, Oktay Günlük authored at least 72 papers between 1994 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Warehouse Problem with Multiple Vendors and Generalized Complementarity Constraints.

Ishan Bansal, Oktay Günlük

CoRR, 2024

2023

Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions.

Rui Chen, Sanjeeb Dash, Oktay Günlük

Discret. Optim., November, 2023

Special Issue: International Symposium on Mathematical Programming 2022.

Damek Shea Davis, Oktay Günlük, Volker Kaibel, Giacomo Nannicini, Xa-Xiang Yuan

Math. Program., July, 2023

Interpretable and Fair Boolean Rule Sets via Column Generation.

Connor Lawless, Sanjeeb Dash, Oktay Günlük, Dennis Wei

J. Mach. Learn. Res., 2023

Multilinear sets with two monomials and cardinality constraints.

Rui Chen, Sanjeeb Dash, Oktay Günlük

Discret. Appl. Math., 2023

Warehouse Problem with Bounds, Fixed Costs and Complementarity Constraints.

Ishan Bansal, Oktay Günlük

CoRR, 2023

Fair Minimum Representation Clustering.

Connor Lawless, Oktay Günlük

CoRR, 2023

Cluster Explanation via Polyhedral Descriptions.

Connor Lawless, Oktay Günlük

Proceedings of the International Conference on Machine Learning, 2023

2022

On a generalization of the Chvátal-Gomory closure.

Sanjeeb Dash, Oktay Günlük, Dabeen Lee

Math. Program., 2022

A Simple Algorithm for Online Decision Making.

Rui Chen, Oktay Günlük, Andrea Lodi, Guanyi Wang

CoRR, 2022

2021

Generalized Chvátal-Gomory closures for integer programs with bounds on variables.

Sanjeeb Dash, Oktay Günlük, Dabeen Lee

Math. Program., 2021

Optimal decision trees for categorical data via integer programming.

Oktay Günlük, Jayant Kalagnanam, Minhan Li, Matt Menickelly, Katya Scheinberg

J. Glob. Optim., 2021

Fair Decision Rules for Binary Classification.

Connor Lawless, Oktay Günlük

CoRR, 2021

Binary Matrix Factorisation and Completion via Integer Programming.

Reka A. Kovacs, Oktay Günlük, Raphael A. Hauser

CoRR, 2021

Binary Matrix Factorisation via Column Generation.

Reka A. Kovacs, Oktay Günlük, Raphael A. Hauser

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Lattice closures of polyhedra.

Sanjeeb Dash, Oktay Günlük, Diego A. Morán R.

Math. Program., 2020

Multilabel Classification by Hierarchical Partitioning and Data-dependent Grouping.

Shashanka Ubaru, Sanjeeb Dash, Arya Mazumdar, Oktay Günlük

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Cardinality Constrained Multilinear Sets.

Rui Chen, Sanjeeb Dash, Oktay Günlük

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019

Generalized Linear Rule Models.

Dennis Wei, Sanjeeb Dash, Tian Gao, Oktay Günlük

Proceedings of the 36th International Conference on Machine Learning, 2019

2018

A note on capacity models for network design.

Alper Atamtürk, Oktay Günlük

Oper. Res. Lett., 2018

Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods.

Pierre Bonami, Oktay Günlük, Jeff T. Linderoth

Math. Program. Comput., 2018

Binary extended formulations of polyhedral mixed-integer sets.

Sanjeeb Dash, Oktay Günlük, Robert Hildebrand

Math. Program., 2018

Robust-to-Dynamics Optimization.

Amir Ali Ahmadi, Oktay Günlük

CoRR, 2018

Low-Rank Boolean Matrix Approximation by Integer Programming.

Reka Kovacs, Oktay Günlük, Raphael A. Hauser

CoRR, 2018

Boolean Decision Rules via Column Generation.

Sanjeeb Dash, Oktay Günlük, Dennis Wei

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017

On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width.

Sanjeeb Dash, Oktay Günlük, Diego A. Morán R.

SIAM J. Optim., 2017

Cutting planes from extended LP formulations.

Merve Bodur, Sanjeeb Dash, Oktay Günlük

Math. Program., 2017

Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse.

Merve Bodur, Sanjeeb Dash, Oktay Günlük, James R. Luedtke

INFORMS J. Comput., 2017

A new lift-and-project operator.

Merve Bodur, Sanjeeb Dash, Oktay Günlük

Eur. J. Oper. Res., 2017

2016

The continuous knapsack set.

Sanjeeb Dash, Oktay Günlük, Laurence A. Wolsey

Math. Program., 2016

On the polyhedrality of cross and quadrilateral closures.

Sanjeeb Dash, Oktay Günlük, Diego A. Morán R.

Math. Program., 2016

Optimal Generalized Decision Trees via Integer Programming.

Matt Menickelly, Oktay Günlük, Jayant Kalagnanam, Katya Scheinberg

CoRR, 2016

2015

On the relative strength of different generalizations of split cuts.

Sanjeeb Dash, Oktay Günlük, Marco Molinaro

Discret. Optim., 2015

Discretization vertex orders in distance geometry.

Andrea Cassioli, Oktay Günlük, Carlile Lavor, Leo Liberti

Discret. Appl. Math., 2015

Robust-to-dynamics linear programming.

Amir Ali Ahmadi, Oktay Günlük

Proceedings of the 54th IEEE Conference on Decision and Control, 2015

2014

Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming.

Sanjeeb Dash, Neil B. Dobbs, Oktay Günlük, Tomasz Nowicki, Grzegorz Swirszcz

Math. Program., 2014

Computational Experiments with Cross and Crooked Cross Cuts.

Sanjeeb Dash, Oktay Günlük, Juan Pablo Vielma

INFORMS J. Comput., 2014

Robust confidentiality preserving data delivery in federated coalition networks.

Lu Su, Yunlong Gao, Fan Ye, Peng Liu, Oktay Günlük, Tom Bcrman, Seraphin B. Calo, Tarek F. Abdelzaher

Proceedings of the 2014 IFIP Networking Conference, Trondheim, 2014

2013

On t-branch split cuts for mixed-integer programs.

Sanjeeb Dash, Oktay Günlük

Math. Program., 2013

On Some Generalizations of the Split Closure.

Sanjeeb Dash, Oktay Günlük, Diego Alejandro Morán Ramírez

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012

The master equality polyhedron with multiple rows.

Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük

Math. Program., 2012

Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra.

Sanjeeb Dash, Santanu S. Dey, Oktay Günlük

Math. Program., 2012

A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows.

Sanjeeb Dash, Oktay Günlük, Andrea Lodi, Andrea Tramontani

INFORMS J. Comput., 2012

2011

A note on the MIR closure and basic relaxations of polyhedra.

Sanjeeb Dash, Oktay Günlük, Christian Raack

Oper. Res. Lett., 2011

On mixed-integer sets with two integer variables.

Sanjeeb Dash, Santanu S. Dey, Oktay Günlük

Oper. Res. Lett., 2011

Strengthening lattice-free cuts using non-negativity.

Ricardo Fukasawa, Oktay Günlük

Discret. Optim., 2011

2010

Perspective reformulations of mixed integer nonlinear programs with indicator variables.

Oktay Günlük, Jeff T. Linderoth

Math. Program., 2010

Erratum to: MIR closures of polyhedral sets.

Sanjeeb Dash, Oktay Günlük, Andrea Lodi

Math. Program., 2010

MIR closures of polyhedral sets.

Sanjeeb Dash, Oktay Günlük, Andrea Lodi

Math. Program., 2010

On a generalization of the master cyclic group polyhedron.

Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük

Math. Program., 2010

Mingling: mixed-integer rounding with bounds.

Alper Atamtürk, Oktay Günlük

Math. Program., 2010

Two-Step MIR Inequalities for Mixed Integer Programs.

Sanjeeb Dash, Marcos Goycoolea, Oktay Günlük

INFORMS J. Comput., 2010

A model for fusion and code motion in an automatic parallelizing compiler.

Uday Bondhugula, Oktay Günlük, Sanjeeb Dash, Lakshminarayanan Renganarayanan

Proceedings of the 19th International Conference on Parallel Architectures and Compilation Techniques, 2010

2009

On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs.

Sanjeeb Dash, Oktay Günlük

SIAM J. Optim., 2009

2008

On the strength of Gomory mixed-integer cuts as group cuts.

Sanjeeb Dash, Oktay Günlük

Math. Program., 2008

A pricing problem under Monge property.

Oktay Günlük

Discret. Optim., 2008

Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables.

Oktay Günlük, Jeff T. Linderoth

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

2007

A New Min-Cut Max-Flow Ratio for Multicommodity Flows.

Oktay Günlük

SIAM J. Discret. Math., 2007

Network design arc set with variable upper bounds.

Alper Atamtürk, Oktay Günlük

Networks, 2007

On the MIR Closure of Polyhedra.

Sanjeeb Dash, Oktay Günlük, Andrea Lodi

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006

Vehicle Routing and Staffing for Sedan Service.

Oktay Günlük, Tracy Kimbrel, Laszlo Ladányi, Baruch Schieber, Gregory B. Sorkin

Transp. Sci., 2006

Valid inequalities based on the interpolation procedure.

Sanjeeb Dash, Oktay Günlük

Math. Program., 2006

Valid inequalities based on simple mixed-integer sets.

Sanjeeb Dash, Oktay Günlük

Math. Program., 2006

2005

A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions.

Oktay Günlük, Laszlo Ladányi, Sven de Vries

Manag. Sci., 2005

2001

Mixing mixed-integer inequalities.

Oktay Günlük, Yves Pochet

Math. Program., 2001

2000

The multicast packing problem.

Shiwen Chen, Oktay Günlük, Bülent Yener

IEEE/ACM Trans. Netw., 2000

1999

A branch-and-cut algorithm for capacitated network design problems.

Oktay Günlük

Math. Program., 1999

1998

Minimum cost capacity installation for multicommodity network flows.

Daniel Bienstock, Sunil Chopra, Oktay Günlük, Chih-Yang Tsai

Math. Program., 1998

Optimal Packing of Group Multi-Casting.

Shiwen Chen, Oktay Günlük, Bülent Yener

Proceedings of the Proceedings IEEE INFOCOM '98, The Conference on Computer Communications, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, Gateway to the 21st Century, San Francisco, CA, USA, March 29, 1998

1996

Capacitated Network Design - Polyhedral Structure and Computation.

Daniel Bienstock, Oktay Günlük

INFORMS J. Comput., 1996

1995

Computational experience with a difficult mixed-integer multicommodity flow problem.

Daniel Bienstock, Oktay Günlük

Math. Program., 1995

1994

A degree sequence problem related to network design.

Daniel Bienstock, Oktay Günlük

Networks, 1994