The following pages link to (Q4411288):
Displaying 15 items.
- Online \(k\)-server routing problems (Q839628) (← links)
- On the power of lookahead in on-line server routing problems (Q959800) (← links)
- An adversarial queueing model for online server routing (Q995586) (← links)
- Evaluating the quality of online optimization algorithms by discrete event simulation (Q1642796) (← links)
- The online food delivery problem on stars (Q2079861) (← links)
- How to whack moles (Q2503357) (← links)
- Topology matters: smoothed competitiveness of metrical task systems (Q2566010) (← links)
- Improved bounds for open online dial-a-ride on the line (Q2701389) (← links)
- Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line (Q3300763) (← links)
- (Q5090461) (← links)
- An Improved Online Algorithm for the Traveling Repairperson Problem on a Line (Q5092364) (← links)
- On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis (Q5323061) (← links)
- New policies for the dynamic traveling salesman problem (Q5426977) (← links)
- (Q5875473) (← links)
- Minimizing the maximum flow time in the online food delivery problem (Q6130315) (← links)
