Submodular stochastic probing on matroids
Year of publication: |
August 2016
|
---|---|
Authors: | Adamczyk, Marek ; Sviridenko, Maxim ; Ward, Justin P. |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 41.2016, 3, p. 1022-1038
|
Subject: | stochastic optimization | submodular maximization | matroids | iterative rounding | stochastic matching | sequential posted pricing | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Stochastischer Prozess | Stochastic process |
-
Maximizing stochastic monotone submodular functions
Asadpour, Arash, (2016)
-
Group equality in adaptive submodular maximization
Tang, Shaojie, (2024)
-
Robust adaptive submodular maximization
Tang, Shaojie, (2022)
- More ...
-
A note on maximizing a submodular set function subject to a knapsack constraint
Sviridenko, Maxim, (2004)
-
A linear time approximation scheme for makespan minimization in an open shop with release dates
Kononov, Alexander, (2002)
-
An improved upper bound for the TSP in cubic 3-edge-connected graphs
Gamarnik, David, (2005)
- More ...