49 citations · 103 across the 15 of their papers we have counts for
16 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…
Probing-Enhanced Stochastic Programming
Zhichao Ma, Youngdae Kim, Jeff Linderoth +2
We consider a two-stage stochastic decision problem where the decision-maker has the opportunity to obtain information about the distribution of the random variables that appea…
An Integer Programming Approach To Subspace Clustering With Missing Data
Akhilesh Soni, Jeff Linderoth, Jim Luedtke +1
In the Subspace Clustering with Missing Data (SCMD) problem, we are given a collection of n partially observed d-dimensional vectors. The data points are assumed to be concentrated…
Relaxations and Cutting Planes for Linear Programs with Complementarity Constraints
Alberto Del Pia, Jeff Linderoth, Haoran Zhu
We study relaxations for linear programs with complementarity constraints, especially instances whose complementary pairs of variables are not independent. Our formulation is based…
New Classes of Facets for Complementarity Knapsack Problems
Alberto Del Pia, Jeff Linderoth, Haoran Zhu
The complementarity knapsack problem (CKP) is a knapsack problem with real-valued variables and complementarity conditions between pairs of its variables. We extend the polyhedral…
On the Complexity of Separating Cutting Planes for the Knapsack Polytope
Alberto Del Pia, Jeff Linderoth, Haoran Zhu
We close three open problems in the separation complexity of valid inequalities for the knapsack polytope. Specifically, we establish that the separation problems for extended cove…