Algorithms for the on-line quota traveling salesman problem
type: Item
instance of: scholarly article
title: Algorithms for the on-line quota traveling salesman problem
zbMATH Open document ID: 1178.90282
author: Giorgio Ausiello
author: Marc Demange
author: Luigi Laura
author: Vangelis Th. Paschos
published in: Information Processing Letters
publication date: 2009-08-27T00:00:00Z
full work available at URL: https://basepub.dauphine.fr/handle/123456789/2525
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5599138
zbMATH Keywords: on-line algorithms
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: quota TSP
MaRDI profile type: Publication
OpenAlex ID: W1989571340
cites work: A 2.5-factor approximation algorithm for the \(k\)-MST problem
cites work: Q2728857
cites work: Algorithms for the on-line travelling salesman
cites work: Q4234074
cites work: New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
cites work: The prize collecting traveling salesman problem
cites work: The online TSP against fair adversaries
cites work: Q4228499
cites work: Q4223058
cites work: On-line single-server dial-a-ride problems
cites work: Online algorithms. The state of the art
cites work: Q4779167
cites work: Q4828977
cites work: Special cases of traveling salesman and repairman problems with time windows
DOI: 10.1016/J.IPL.2004.06.013
description: scientific article; zbMATH DE number 5599138