The following pages link to (Q2728895):
Displayed 18 items.
- Online \(k\)-server routing problems (Q839628) (← links)
- A hard dial-a-ride problem that is easy on average (Q880497) (← links)
- On the power of lookahead in on-line server routing problems (Q959800) (← links)
- An adversarial queueing model for online server routing (Q995586) (← links)
- Dynamic pickup and delivery problems (Q1038370) (← links)
- Two short notes on the on-line travelling salesman: handling times and lookahead. (Q1853561) (← links)
- Computational bounds for elevator control policies by large scale linear programming (Q2441574) (← links)
- Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models (Q2500540) (← links)
- How to whack moles (Q2503357) (← 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)
- Tight analysis of the lazy algorithm for open online dial-a-ride (Q6138988) (← links)
- An improved algorithm for open online dial-a-ride (Q6176557) (← links)