The Online TSP Against Fair Adversaries

DOI10.1287/ijoc.13.2.138.10517zbMath1238.90127OpenAlexW2165780346MaRDI QIDQ2884500

Willem E. de Paepe, Michiel Blom, Leen Stougie, Sven O. Krumke

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

zbMATH Keywords

vehicle routinganalysis of algorithms networks-graphstraveling salesman transportation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (24)

Algorithms for the on-line quota traveling salesman problem ⋮ Optimal deterministic algorithms for some variants of online quota traveling salesman problem ⋮ Online \(k\)-server routing problems ⋮ Online Predictions for Online TSP on the Line ⋮ Tight analysis of the lazy algorithm for open online dial-a-ride ⋮ Online TSP with known locations ⋮ Unnamed Item ⋮ An improved algorithm for open online dial-a-ride ⋮ Improved bounds for open online dial-a-ride on the line ⋮ The on-line asymmetric traveling salesman problem ⋮ Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line ⋮ Online traveling salesman problem with deadlines and service flexibility ⋮ Competitive analysis of a dispatch policy for a dynamic multi-period routing problem ⋮ Online Vehicle Routing Problems: A Survey ⋮ Online graph exploration algorithms for cycles and trees by multiple searchers ⋮ On the power of lookahead in on-line server routing problems ⋮ Unnamed Item ⋮ How to whack moles ⋮ Discrete online TSP ⋮ Online traveling salesman problems with service flexibility ⋮ Fleet management for autonomous vehicles: Online PDP under special constraints ⋮ The online food delivery problem on stars ⋮ Online traveling salesman problem with time cost and non-zealous server ⋮ Topology matters: smoothed competitiveness of metrical task systems

This page was built for publication: The Online TSP Against Fair Adversaries