53 citations · 115 across the 17 of their papers we have counts for
19 papers
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…
Parallel Token Swapping for Qubit Routing
Ishan Bansal, Oktay Günlük, Richard Shapley
In this paper we study a combinatorial reconfiguration problem that involves finding an optimal sequence of swaps to move an initial configuration of tokens that are placed on the…
Warehouse Problem with Multiple Vendors and Generalized Complementarity Constraints
Ishan Bansal, Oktay Günlük
We study the warehouse problem, arising in the area of inventory management and production planning. Here, a merchant wants to decide an optimal trading policy that computes quanti…
Warehouse Problem with Bounds, Fixed Costs and Complementarity Constraints
Ishan Bansal, Oktay Günlük
This paper studies an open question in the warehouse problem where a merchant trading a commodity tries to find an optimal inventory-trading policy to decide on purchase and sale q…
Cluster Explanation via Polyhedral Descriptions
Connor Lawless, Oktay Gunluk
Clustering is an unsupervised learning problem that aims to partition unlabelled data points into groups with similar features. Traditional clustering algorithms provide limited in…
Interpretable and Fair Boolean Rule Sets via Column Generation
Connor Lawless, Sanjeeb Dash, Oktay Gunluk +1
This paper considers the learning of Boolean rules in disjunctive normal form (DNF, OR-of-ANDs, equivalent to decision rule sets) as an interpretable model for classification. An i…
Optimal qubit assignment and routing via integer programming
Giacomo Nannicini, Lev S Bishop, Oktay Gunluk +1
We consider the problem of mapping a logical quantum circuit onto a given hardware with limited two-qubit connectivity. We model this problem as an integer linear program, using a…
Fair Decision Rules for Binary Classification
Connor Lawless, Oktay Gunluk
In recent years, machine learning has begun automating decision making in fields as varied as college admissions, credit lending, and criminal sentencing. The socially sensitive na…
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…
Multilabel Classification by Hierarchical Partitioning and Data-dependent Grouping
Shashanka Ubaru, Sanjeeb Dash, Arya Mazumdar +1
In modern multilabel classification problems, each data instance belongs to a small number of classes from a large set of classes. In other words, these problems involve learning v…
Generalized Linear Rule Models
Dennis Wei, Sanjeeb Dash, Tian Gao +1
This paper considers generalized linear models using rule-based features, also referred to as rule ensembles, for regression and probabilistic classification. Rules facilitate mode…
Boolean Decision Rules via Column Generation
Sanjeeb Dash, Oktay Günlük, Dennis Wei
This paper considers the learning of Boolean rules in either disjunctive normal form (DNF, OR-of-ANDs, equivalent to decision rule sets) or conjunctive normal form (CNF, AND-of-ORs…
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…
Low-Rank Boolean Matrix Approximation by Integer Programming
Reka Kovacs, Oktay Gunluk, Raphael Hauser
Low-rank approximations of data matrices are an important dimensionality reduction tool in machine learning and regression analysis. We consider the case of categorical variables,…
Multi-Commodity Multi-Facility Network Design
Alper Atamturk, Oktay Gunluk
We consider multi-commodity network design models, where capacity can be added to the arcs of the network using multiples of facilities that may have different capacities. This cla…
Optimal Generalized Decision Trees via Integer Programming
Oktay Gunluk, Jayant Kalagnanam, Minhan Li +2
Decision trees have been a very popular class of predictive models for decades due to their interpretability and good performance on categorical features. However, they are not alw…