1 citations · 1 across the 2 of their papers we have counts for
3 papers
math.OC2026
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…
math.OC2026★ 1 cited
Online Decision Making with Fairness over Time
Rui Chen, Oktay Gunluk, Andrea Lodi +1
Online platforms increasingly rely on sequential decision-making algorithms to allocate resources, match users, or control exposure, while facing growing pressure to ensure fairnes…
math.OC2025
Fair Clustering with Minimum Representation Constraints
Connor Lawless, Oktay Gunluk
Clustering is a well-studied unsupervised learning task that aims to partition data points into a number of clusters. In many applications, these clusters correspond to real-world…