Fetching the paper…
Reading the bibliography…
We consider a general conic mixed-binary set where each homogeneous conic constraint $j$ involves an affine function of independent continuous variables and an epigraph variable associated with a nonnegative function, $f_j$, of common binary variables.
Submodular functions, matroids, and certain polyhedra
J. Edmonds · 1970
Earlier work this paper cites.
Disjunctive programming
E. Balas · 1979
Earlier work this paper cites.
Submodular functions and convexity
L. Lovász · 1983
Earlier work this paper cites.
Integer and Combinatorial Optimization
G.L. Nemhauser and L.A. Wolsey · 1988
Earlier work this paper cites.
On sparse approximations to randomized strategies and convex combinations
I. Althöfer · 1994
Earlier work this paper cites.
Tight formulations for some simple mixed integer programs and convex objective integer programs
A.J. Miller and L.A. Wolsey · 2003
Earlier work this paper cites.
N. Ho-Nguyen, F. Kılınç-Karzan, S. Küçükyavuz, and D. Lee · 2007
Earlier work this paper cites.
Polymatroids and mean-risk minimization in discrete optimization
A. Atamtürk and V. Narayanan · 2008
Earlier work this paper cites.
Structured sparsity-inducing norms through submodular functions
F. Bach · 2010
Cited alongside, same era.
Exact algorithms for combinatorial optimization problems with submodular objective functions
F. Baumann, S. Berckey, and C. Buchheim · 2013
Cited alongside, same era.
Integer programming , volume 271
M. Conforti, G. Cornuéjols, and G. Zambelli · 2014
Cited alongside, same era.
Sparse sums of positive semidefinite matrices
M.K. de Carli Silva, N.J.A. Harvey, and C.M. Sato · 2015
Cited alongside, same era.
Best subset selection via a modern optimization lens
D. Bertsimas, A. King, and R. Mazumder · 2016
Cited alongside, same era.
Fractional 0-1 programming: applications and algorithms
J.S. Borrero, C. Gillen, and O.A. Prokopyev · 2017
Cited alongside, same era.
Submodularity in conic quadratic mixed 0-1 optimization
A. Atamtürk and A. Gómez · 2020
Closest in time.
A mixed-integer fractional optimization approach to best subset selection
A. Gómez and O. Prokopyev · 2021
Closest in time.
On distributionally robust chance constrained programs with Wasserstein distance
W. Xie · 2021
Closest in time.
A polyhedral approach to bisubmodular function minimization
Q. Yu and S. Küçükyavuz · 2021
Closest in time.
Submodular function minimization and polarity
A. Atamtürk and V. Narayanan · 2022
Closest in time.
Data-driven chance constrained programs over Wasserstein balls
Z. Chen, D. Kuhn, and W. Wiesemann · 2022
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
UCI machine learning repository, 2017
D. Dua and C. Graff · 2017
Cited alongside, same era.
Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity
N. Ho-Nguyen, F. Kılınç-Karzan, S. Küçükyavuz, and D. Lee
Cited in the paper.
Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens
F. Kılınç-Karzan, S. Küçükyavuz, and D. Lee · 2022
Closest in time.