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

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 154; no. 1-2; pp. 145 - 172
Main Authors:	Bansal, Nikhil, Nagarajan, Viswanath
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2015 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!