Approximation results for kinetic variants of TSP

DOI10.1007/S00454-001-0081-4zbMath1008.68058OpenAlexW1862548325MaRDI QIDQ1611067

Bengt J. Nilsson, Mikael Hammar

Publication date: 20 August 2002

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-001-0081-4

zbMATH Keywords

traveling salesman problemapproximation complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

The single line moving target traveling salesman problem with release times ⋮ Vehicle Routing Algorithms for Radially Escaping Targets ⋮ A bi-criteria moving-target travelling salesman problem under uncertainty ⋮ The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches ⋮ A customized genetic algorithm for bi-objective routing in a dynamic network ⋮ Grasp and delivery for moving objects on broken lines

This page was built for publication: Approximation results for kinetic variants of TSP