An improved analysis of local search for max-sum diversification
Year of publication: |
2019
|
---|---|
Authors: | Cevallos, Alfonso ; Eisenbrand, Friedrich ; Zenklusen, Rico |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 44.2019, 4, p. 1494-1509
|
Subject: | remote clique | dispersion | local search | negative type distances | matroid constraints | submodular maximization | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Optimal approximation for submodular and supermodular optimization with bounded curvature
Sviridenko, Maxim, (2017)
-
Structured robust submodular maximization : offline and online algorithms
Torrico, Alfredo, (2021)
-
Submodular stochastic probing on matroids
Adamczyk, Marek, (2016)
- More ...
-
Parametric integer programming in fixed dimension
Eisenbrand, Friedrich, (2008)
-
Network formulations of mixed-integer programs
Conforti, Michele, (2009)
-
Diameter of polyhedra : limits of abstraction
Eisenbrand, Friedrich, (2010)
- More ...