The online TSP against fair adversaries
DOI10.1287/IJOC.13.2.138.10517zbMATH Open1238.90127OpenAlexW2165780346MaRDI QIDQ2884500FDOQ2884500
Authors: Michiel Blom, Willem E. De Paepe, Sven O. Krumke, L. Stougie 
Publication date: 30 May 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1d84c7da58b35fe74baf7c26f6d5d3810d67738b
Recommendations
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Transportation, logistics and supply chain management (90B06)
Cited In (30)
- Online TSP with known locations
- Tight analysis of the lazy algorithm for open online dial-a-ride
- On the power of lookahead in on-line server routing problems
- Online traveling salesman problems with service flexibility
- Title not available (Why is that?)
- Online \(k\)-server routing problems
- Discrete online TSP
- Online Vehicle Routing Problems: A Survey
- Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
- How to whack moles
- Fleet management for autonomous vehicles: online PDP under special constraints
- Tight bounds for online TSP on the line
- Optimal deterministic algorithms for some variants of online quota traveling salesman problem
- Online graph exploration algorithms for cycles and trees by multiple searchers
- Algorithms for the on-line quota traveling salesman problem
- Online Predictions for Online TSP on the Line
- The on-line asymmetric traveling salesman problem
- An improved algorithm for open online dial-a-ride
- Topology matters: smoothed competitiveness of metrical task systems
- Title not available (Why is that?)
- Online traveling salesman problems with rejection options
- The online transportation problem
- Online traveling salesman problem with deadlines and service flexibility
- The online food delivery problem on stars
- Online traveling salesman problem with time cost and non-zealous server
- Improved bounds for open online dial-a-ride on the line
- TSP with locational uncertainty: the adversarial model
- Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
- Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
- Title not available (Why is that?)
This page was built for publication: The online TSP against fair adversaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884500)
