Pages that link to "Item:Q5245015"

The following pages link to Running Errands in Time: Approximation Algorithms for Stochastic Orienteering (Q5245015):

Displaying 14 items.

• The capacitated orienteering problem (Q496434) (← links)
• The orienteering problem with stochastic travel and service times (Q646634) (← links)
• Minimizing latency of capacitated \(k\)-tours (Q724250) (← links)
• On the adaptivity gap of stochastic orienteering (Q896283) (← 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)
• A dynamic and probabilistic orienteering problem (Q2669558) (← links)
• (Q4782745) (← links)
• Stochastic graph exploration (Q5092339) (← links)
• (Q5136319) (← links)
• Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms (Q5219671) (← links)
• (Q5743496) (← links)