Approximation algorithms for time-dependent orienteering.
type: Item
instance of: scholarly article
title: Approximation algorithms for time-dependent orienteering.
zbMATH Open document ID: 1043.90076
DOI: 10.1016/S0020-0190(01)00313-1
author: Fedor V. Fomin
author: Andrzej Lingas
published in: Information Processing Letters
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 1856390
zbMATH Keywords: Time-depending orienteering
zbMATH Keywords: Traveling salesman
zbMATH Keywords: Approximation algorithms
zbMATH Keywords: Network design
Wikidata QID: Q60488782
MaRDI profile type: Publication
cites work: Q4234074
cites work: The prize collecting traveling salesman problem
cites work: Approximation algorithms for the TSP with sharpened triangle inequality
cites work: Efficient web searching using temporal factors
cites work: The orienteering problem
cites work: Q4952698
cites work: Bicriteria Network Design Problems
cites work: On the approximability of the traveling salesman problem (extended abstract)
cites work: The Traveling Salesman Problem with Distances One and Two
cites work: On the approximability of an interval scheduling problem
full work available at URL: s0020-0190(01)00313-1
OpenAlex ID: W2039097929
description: scientific article; zbMATH DE number 1856390