Approximation algorithms for correlated knapsack orienteering
From MaRDI portal
Cites work
- Approximating the stochastic Knapsack problem: the benefit of adaptivity
- Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
- Approximation algorithms for deadline-TSP and vehicle routing with time-windows
- Approximation algorithms for distance constrained vehicle routing problems
- Approximation Algorithms for Orienteering and Discounted-Reward TSP
- Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
- Approximation algorithms for stochastic k-TSP
- Approximation algorithms for stochastic submodular set cover with applications to Boolean function evaluation and min-knapsack
- Compact, provably-good LPs for orienteering and regret-bounded vehicle routing
- Facility location with client latencies: LP-based techniques for minimum-latency problems
- scientific article; zbMATH DE number 7650393 (Why is no real title available?)
- Improved algorithms for orienteering and related problems
- Improvements and generalizations of stochastic knapsack and multi-armed bandit approximation algorithms: extended abstract
- Multi-armed Bandits with Metric Switching Costs
- On the adaptivity gap of stochastic orienteering
- Pandora's box with correlations: learning and approximation
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
- The \(k\)-traveling repairmen problem
- The minimum latency problem
- The orienteering problem
This page was built for publication: Approximation algorithms for correlated knapsack orienteering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6920814)
