On the adaptivity gap of stochastic orienteering

The input to the stochastic orienteering problem (Gupta et al. in SODA, pp 1522–1538, 2012 ) consists of a budget B and metric ( V , d ) where each vertex v ∈ V has a job with a deterministic reward and a random processing time (drawn from a known distribution). The processing times are independe...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematical programming Jg. 154; H. 1-2; S. 145 - 172
Hauptverfasser:	Bansal, Nikhil, Nagarajan, Viswanath
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2015 Springer Nature B.V
Schlagworte:	Algorithms Approximation Calculus of Variations and Optimal Control; Optimization Combinatorics Correlation Full Length Paper Knapsack problem Mathematical analysis Mathematical and Computational Physics Mathematical Methods in Physics Mathematical programming Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Optimization Orienteering Policies Random variables Routing Stochastic control theory Stochasticity Studies Texts Theoretical Travel Upper bounds 90B36 Vehicle routing 90B15 Approximation algorithms Stochastic 68W25 90B06
ISSN:	0025-5610, 1436-4646
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!