Submodular maximization through the lens of linear programming
Year of publication: |
2019
|
---|---|
Authors: | Bruggmann, Simon ; Zenklusen, Rico |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 44.2019, 4, p. 1221-1244
|
Subject: | submodular function maximization | approximation algorithms | local search | hardness of approximation | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
On some variants of Euclidean k-supplier
Lee, Euiwoong, (2022)
-
The approximability of assortment optimization under ranking preferences
Aouad, Ali, (2018)
-
Assortment optimization over time
Fonseca, José da, (2015)
- More ...
-
A 2-approximation for the maximum satisfying bisection problem
Ries, Bernard, (2011)
-
Stochastic convergence of random search methods to fixed size Pareto front approximations
Laumanns, Marco, (2011)
-
An adaptive routing approach for personal rapid transit
Schüpbach, Kaspar, (2013)
- More ...