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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Mathematical programming Ročník 154; číslo 1-2; s. 145 - 172
Hlavní autori:	Bansal, Nikhil, Nagarajan, Viswanath
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2015 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!