Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7053373
- scientific article; zbMATH DE number 1839476
- Approximation algorithms for time-dependent orienteering.
- Approximation Algorithms for Orienteering and Discounted-Reward TSP
- The orienteering problem with stochastic travel and service times
- Approximation algorithms for the arc orienteering problem
- Solving the stochastic time-dependent orienteering problem with time windows
- Constant approximation for stochastic orienteering problem with \((1+\epsilon)\)-budget relaxation
- Optimization approaches for solving chance constrained stochastic orienteering problems
- An Optimal Algorithm for the Orienteering Tour Problem
Cites work
- A Characterization of Waiting Time Performance Realizable by Single-Server Queues
- Approximating Matches Made in Heaven
- Approximating optimal binary decision trees
- Approximating the stochastic Knapsack problem: the benefit of adaptivity
- Approximation algorithms for budgeted learning problems
- Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
- Approximation algorithms for deadline-TSP and vehicle routing with time-windows
- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
- Approximation Algorithms for Orienteering and Discounted-Reward TSP
- Approximation in stochastic scheduling
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
- scientific article; zbMATH DE number 2185610 (Why is no real title available?)
- Improved algorithms for orienteering and related problems
- Improved approximation results for stochastic knapsack problems
- Learning Theory
- Maximizing a monotone submodular function subject to a matroid constraint
- Multi-armed Bandits with Metric Switching Costs
- On Multidimensional Packing Problems
- On tail probabilities for martingales
- On the adaptivity gap of stochastic orienteering
- Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
- The directed orienteering problem
- The Euclidean Orienteering Problem Revisited
- The orienteering problem with stochastic travel and service times
- When LP is the cure for your matching woes: improved bounds for stochastic matchings
Cited in
(21)- Rollout-based routing strategies with embedded prediction: a fish trawling application
- Faster algorithms for orienteering and \(k\)-TSP
- Non-adaptive stochastic score classification and explainable halfspace evaluation
- An adversarial model for scheduling with testing
- Constant approximation for stochastic orienteering problem with \((1+\epsilon)\)-budget relaxation
- A dynamic and probabilistic orienteering problem
- scientific article; zbMATH DE number 1839476 (Why is no real title available?)
- The capacitated orienteering problem
- Stochastic graph exploration
- The robot routing problem for collecting aggregate stochastic rewards
- Approximation algorithms for stochastic k-TSP
- Improvements and generalizations of stochastic knapsack and Markovian bandits approximation algorithms
- On the adaptivity gap of stochastic orienteering
- scientific article; zbMATH DE number 7053373 (Why is no real title available?)
- Stochastic graph exploration with limited resources
- The orienteering problem with stochastic travel and service times
- Approximation algorithms for correlated knapsack orienteering
- Minimizing latency of capacitated \(k\)-tours
- Identifying approximate minimizers under stochastic uncertainity
- Approximation schemes for orienteering and deadline TSP in doubling metrics
- On the adaptivity gap of stochastic orienteering
This page was built for publication: Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5245015)
