Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems
Year of publication: |
2022
|
---|---|
Authors: | Ghuge, Rohan ; Nagarajan, Viswanath |
Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 47.2022, 2, p. 1612-1630
|
Subject: | approximation algorithms | network design | submodularity | Algorithmus | Algorithm | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Netzwerk | Network | Operations Research | Operations research |
-
Incremental network design with maximum flows
Kalinowski, Thomas, (2015)
-
On the hop-constrained survivable network design problem with reliable edges
Botton, Quentin, (2014)
-
Exact and heuristic algorithms for the design of hub networks with multiple lines
Martins de Sá, Elisangela, (2015)
- More ...
-
Constrained assortment optimization under the paired combinatorial logit model
Ghuge, Rohan, (2022)
-
The power of adaptivity for stochastic submodular cover
Ghuge, Rohan, (2024)
-
Technical Note-Approximation Algorithms for VRP with Stochastic Demands
Gupta, Anupam, (2012)
- More ...