Structured robust submodular maximization : offline and online algorithms
Year of publication: |
2021
|
---|---|
Authors: | Torrico, Alfredo ; Singh, Mohit ; Pokutta, Sebastian ; Haghtalab, Nika ; Naor, Joseph Seffi ; Anari, Nima |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 33.2021, 4, p. 1590-1607
|
Subject: | greedy algorithm | matroid constraints | online learning | robust optimization | submodular optimization | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Robustes Verfahren | Robust statistics |
-
Oracle-based robust optimization via online learning
Ben-Tal, Aharon, (2015)
-
A robust optimization model for a supply chain under uncertainty
Hosseini, Sara, (2014)
-
Models and algorithms for stochastic and robust vehicle routing with deadlines
Adulyasak, Yossiri, (2016)
- More ...
-
Online primal-dual algorithms for covering and packing
Buchbinder, Niv, (2009)
-
Buchbinder, Niv, (2013)
-
Additive consisency of risk measures and its application to risk-averse routing in networks
Cominetti, Roberto, (2016)
- More ...