16 citations · 21 across the 9 of their papers we have counts for
7 papers · 1 filter
Sparse Cuts for the Positive Semidefinite Cone
Oktay Günlük, Paul Jünger, Jeff Linderoth +2
We consider optimization problems containing nonconvex quadratic functions for which semidefinite programming (SDP) relaxations often yield strong bounds. We investigate linear ine…
Binary Matrix Factorisation and Completion via Integer Programming
Reka A. Kovacs, Oktay Gunluk, Raphael A. Hauser
Binary matrix factorisation is an essential tool for identifying discrete patterns in binary data. In this paper we consider the rank-k binary matrix factorisation problem (k-BMF)…
Multilinear Sets with Two Monomials and Cardinality Constraints
Rui Chen, Sanjeeb Dash, Oktay Gunluk
Binary polynomial optimization is equivalent to the problem of minimizing a linear function over the intersection of the multilinear set with a polyhedron. Many families of valid i…
Binary Matrix Factorisation via Column Generation
Reka A. Kovacs, Oktay Gunluk, Raphael A. Hauser
Identifying discrete patterns in binary data is an important dimensionality reduction tool in machine learning and data mining. In this paper, we consider the problem of low-rank b…
On a generalization of the Chvatal-Gomory closure
Sanjeeb Dash, Oktay Gunluk, Dabeen Lee
Many practical integer programming problems involve variables with one or two-sided bounds. Dunkel and Schulz (2012) considered a strengthened version of Chvatal-Gomory (CG) inequa…
Robust-to-Dynamics Optimization
Amir Ali Ahmadi, Oktay Gunluk
A robust-to-dynamics optimization (RDO) problem is an optimization problem specified by two pieces of input: (i) a mathematical program (an objective function $f:\mathbb{R}^n\right…