Approximation algorithms for optimal decision trees and adaptive TSP problems
Year of publication: |
August 2017
|
---|---|
Authors: | Gupta, Anupam ; Nagarajan, Viswanath ; Ravi, Ramamoorthi |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 42.2017, 3, p. 876-896
|
Subject: | approximation algorithms | stochastic optimization | decision trees | vehicle routing | Entscheidungsbaum | Decision tree | Theorie | Theory | Algorithmus | Algorithm | Operations Research | Operations research | Tourenplanung | Vehicle routing problem | Stochastischer Prozess | Stochastic process | Mathematische Optimierung | Mathematical programming |
-
Running errands in time : approximation algorithms for stochastic orienteering
Gupta, Anupam, (2015)
-
Adaptive submodular ranking and routing
Navidi, Fatemeh, (2020)
-
Prescriptive analytics for inventory management in health care
Galli, Leonardo, (2021)
- More ...
-
Approximation algorithms for VRP with stochastic demands
Gupta, Anupam, (2012)
-
Running errands in time : approximation algorithms for stochastic orienteering
Gupta, Anupam, (2015)
-
Capacitated vehicle routing with nonuniform speeds
Gørtz, Inge Li, (2016)
- More ...