Running errands in time : approximation algorithms for stochastic orienteering
Year of publication: |
2015
|
---|---|
Authors: | Gupta, Anupam ; Krishnaswamy, Ravishankar ; Nagarajan, Viswanath ; Ravi, Ramamoorthi |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 40.2015, 1, p. 56-79
|
Subject: | approximation algorithms | adaptivity gap | orienteering problem | stochastic optimization | Stochastischer Prozess | Stochastic process | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
Stochastic load balancing on unrelated machines
Gupta, Anupam, (2021)
-
Approximation algorithms for optimal decision trees and adaptive TSP problems
Gupta, Anupam, (2017)
-
Adaptive submodular ranking and routing
Navidi, Fatemeh, (2020)
- More ...
-
Approximation algorithms for VRP with stochastic demands
Gupta, Anupam, (2012)
-
Approximation algorithms for optimal decision trees and adaptive TSP problems
Gupta, Anupam, (2017)
-
Facility location with matroid or knapsack constraints
Krishnaswamy, Ravishankar, (2015)
- More ...