21 citations · 67 across the 10 of their papers we have counts for
5 papers · 1 filter
Supermodularity and valid inequalities for quadratic optimization with indicators
Alper Atamturk, Andres Gomez
We study the minimization of a rank-one quadratic with indicators and show that the underlying set function obtained by projecting out the continuous variables is supermodular. Alt…
Fractional 0-1 programming and submodularity
Shaoning Han, Andres Gomez, Oleg A Prokopyev
In this note we study multiple-ratio fractional 0--1 programs, a broad class of NP-hard combinatorial optimization problems. In particular, under some relatively mild assumptions w…
Ideal formulations for constrained convex optimization problems with indicator variables
Linchuan Wei, Andres Gomez, Simge Kucukyavuz
Motivated by modern regression applications, in this paper, we study the convexification of a class of convex optimization problems with indicator variables and combinatorial const…
Safe Screening Rules for -Regression
Alper Atamtürk, Andrés Gómez
We give safe screening rules to eliminate variables from regression with regularization or cardinality constraint. These rules are based on guarantees that a feature may o…
Learning Optimal Classification Trees: Strong Max-Flow Formulations
Sina Aghaei, Andres Gomez, Phebe Vayanos
We consider the problem of learning optimal binary classification trees. Literature on the topic has burgeoned in recent years, motivated both by the empirical suboptimality of heu…