Pages that link to "Item:Q2884500"
From MaRDI portal
The following pages link to The online TSP against fair adversaries (Q2884500):
Displaying 24 items.
- Optimal deterministic algorithms for some variants of online quota traveling salesman problem (Q296870) (← links)
- Online traveling salesman problem with deadlines and service flexibility (Q498429) (← links)
- Algorithms for the on-line quota traveling salesman problem (Q834904) (← links)
- Online \(k\)-server routing problems (Q839628) (← links)
- The on-line asymmetric traveling salesman problem (Q935844) (← links)
- On the power of lookahead in on-line server routing problems (Q959800) (← links)
- The online food delivery problem on stars (Q2079861) (← links)
- Online traveling salesman problem with time cost and non-zealous server (Q2082223) (← links)
- Online graph exploration algorithms for cycles and trees by multiple searchers (Q2251142) (← links)
- Competitive analysis of a dispatch policy for a dynamic multi-period routing problem (Q2467440) (← 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)
- Online traveling salesman problems with service flexibility (Q3100693) (← links)
- Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line (Q3300763) (← links)
- Online Vehicle Routing Problems: A Survey (Q3564358) (← links)
- Discrete online TSP (Q3638442) (← links)
- TSP with locational uncertainty: the adversarial model (Q4580107) (← links)
- (Q5090461) (← links)
- Fleet management for autonomous vehicles: Online PDP under special constraints (Q5242278) (← links)
- (Q5875473) (← links)
- Online Predictions for Online TSP on the Line (Q6066466) (← links)
- The online transportation problem (Q6102324) (← links)
- An improved algorithm for open online dial-a-ride (Q6176557) (← links)
