On the Adaptivity Gap of Stochastic Orienteering

DOI10.1007/978-3-319-07557-0_10zbMath1415.90046OpenAlexW2568043714MaRDI QIDQ5418989

Viswanath Nagarajan, Nikhil Bansal

Publication date: 2 June 2014

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07557-0_10

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Related Items (7)

Approximation algorithms for stochastic combinatorial optimization problems ⋮ On the adaptivity gap of stochastic orienteering ⋮ Unnamed Item ⋮ Stochastic graph exploration with limited resources ⋮ Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms ⋮ Stochastic graph exploration ⋮ Running Errands in Time: Approximation Algorithms for Stochastic Orienteering

This page was built for publication: On the Adaptivity Gap of Stochastic Orienteering