Pages that link to "Item:Q5245015"
From MaRDI portal
The following pages link to Running Errands in Time: Approximation Algorithms for Stochastic Orienteering (Q5245015):
Displaying 10 items.
- The capacitated orienteering problem (Q496434) (← links)
- Minimizing latency of capacitated \(k\)-tours (Q724250) (← links)
- Rollout-based routing strategies with embedded prediction: a fish trawling application (Q2108157) (← links)
- Faster algorithms for orienteering and \(k\)-TSP (Q2124233) (← links)
- Non-adaptive stochastic score classification and explainable halfspace evaluation (Q2164705) (← links)
- An adversarial model for scheduling with testing (Q2211361) (← links)
- Stochastic graph exploration (Q5092339) (← links)
- (Q5136319) (← links)
- Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms (Q5219671) (← links)
- Stochastic graph exploration with limited resources (Q6176558) (← links)