Oktay Günlük

According to our database1, Oktay Günlük authored at least 59 papers between 1994 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


Lattice closures of polyhedra.
Math. Program., 2020

Binary Matrix Factorisation via Column Generation.
CoRR, 2020

Multilabel Classification by Hierarchical Partitioning and Data-dependent Grouping.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Cardinality Constrained Multilinear Sets.
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

On a Generalization of the Chvátal-Gomory Closure.
Proceedings of the Integer Programming and Combinatorial Optimization, 2020

Generalized Linear Rule Models.
Proceedings of the 36th International Conference on Machine Learning, 2019

A note on capacity models for network design.
Oper. Res. Lett., 2018

Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods.
Math. Program. Comput., 2018

Binary extended formulations of polyhedral mixed-integer sets.
Math. Program., 2018

Robust-to-Dynamics Optimization.
CoRR, 2018

Low-Rank Boolean Matrix Approximation by Integer Programming.
CoRR, 2018

Boolean Decision Rules via Column Generation.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width.
SIAM J. Optim., 2017

Cutting planes from extended LP formulations.
Math. Program., 2017

Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse.
INFORMS J. Comput., 2017

A new lift-and-project operator.
Eur. J. Oper. Res., 2017

The continuous knapsack set.
Math. Program., 2016

On the polyhedrality of cross and quadrilateral closures.
Math. Program., 2016

Optimal Generalized Decision Trees via Integer Programming.
CoRR, 2016

On the relative strength of different generalizations of split cuts.
Discret. Optim., 2015

Discretization vertex orders in distance geometry.
Discret. Appl. Math., 2015

Robust-to-dynamics linear programming.
Proceedings of the 54th IEEE Conference on Decision and Control, 2015

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

Computational Experiments with Cross and Crooked Cross Cuts.
INFORMS J. Comput., 2014

Robust confidentiality preserving data delivery in federated coalition networks.
Proceedings of the 2014 IFIP Networking Conference, Trondheim, 2014

On t-branch split cuts for mixed-integer programs.
Math. Program., 2013

On Some Generalizations of the Split Closure.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

The master equality polyhedron with multiple rows.
Math. Program., 2012

Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra.
Math. Program., 2012

A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows.
INFORMS J. Comput., 2012

A note on the MIR closure and basic relaxations of polyhedra.
Oper. Res. Lett., 2011

On mixed-integer sets with two integer variables.
Oper. Res. Lett., 2011

Strengthening lattice-free cuts using non-negativity.
Discret. Optim., 2011

Perspective reformulations of mixed integer nonlinear programs with indicator variables.
Math. Program., 2010

Erratum to: MIR closures of polyhedral sets.
Math. Program., 2010

MIR closures of polyhedral sets.
Math. Program., 2010

On a generalization of the master cyclic group polyhedron.
Math. Program., 2010

Mingling: mixed-integer rounding with bounds.
Math. Program., 2010

Two-Step MIR Inequalities for Mixed Integer Programs.
INFORMS J. Comput., 2010

A model for fusion and code motion in an automatic parallelizing compiler.
Proceedings of the 19th International Conference on Parallel Architectures and Compilation Techniques, 2010

On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs.
SIAM J. Optim., 2009

On the strength of Gomory mixed-integer cuts as group cuts.
Math. Program., 2008

A pricing problem under Monge property.
Discret. Optim., 2008

Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables.
Proceedings of the Integer Programming and Combinatorial Optimization, 2008

A New Min-Cut Max-Flow Ratio for Multicommodity Flows.
SIAM J. Discret. Math., 2007

Network design arc set with variable upper bounds.
Networks, 2007

On the MIR Closure of Polyhedra.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

Vehicle Routing and Staffing for Sedan Service.
Transp. Sci., 2006

Valid inequalities based on the interpolation procedure.
Math. Program., 2006

Valid inequalities based on simple mixed-integer sets.
Math. Program., 2006

A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions.
Manag. Sci., 2005

Mixing mixed-integer inequalities.
Math. Program., 2001

The multicast packing problem.
IEEE/ACM Trans. Netw., 2000

A branch-and-cut algorithm for capacitated network design problems.
Math. Program., 1999

Minimum cost capacity installation for multicommodity network flows.
Math. Program., 1998

Optimal Packing of Group Multi-Casting.
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

Capacitated Network Design - Polyhedral Structure and Computation.
INFORMS J. Comput., 1996

Computational experience with a difficult mixed-integer multicommodity flow problem.
Math. Program., 1995

A degree sequence problem related to network design.
Networks, 1994