Constrained submodular maximization via greedy local search
Year of publication: |
2019
|
---|---|
Authors: | Sarpatwar, Kanthi K. ; Schieber, Baruch ; Shachnai, Hadas |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 47.2019, 1, p. 1-6
|
Subject: | Submodular functions | Matroid | Knapsack | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Facility location with matroid or knapsack constraints
Krishnaswamy, Ravishankar, (2015)
-
Polynomially computable bounds for the probability of the union of events
Boros, Endre, (2014)
-
Tight approximations of dynamic risk measures
Iancu, Dan A., (2015)
- More ...
-
Real-time scheduling to minimize machine busy times
Khandekar, Rohit, (2015)
-
The Euclidean k-supplier problem
Nagarajan, Viswanath, (2020)
-
The preemptive resource allocation problem
Sarpatwar, Kanthi, (2024)
- More ...