Approximation algorithms for time-dependent orienteering.

DOI10.1016/S0020-0190(01)00313-1zbMath1043.90076OpenAlexW2039097929WikidataQ60488782 ScholiaQ60488782MaRDI QIDQ1853044

Fedor V. Fomin, Andrzej Lingas

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00313-1

zbMATH Keywords

Traveling salesmanApproximation algorithmsNetwork designTime-depending orienteering

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Related Items (15)

A matheuristic approach to the orienteering problem with service time dependent profits ⋮ Particle swarm optimization-based algorithms for TSP and generalized TSP ⋮ Time dependent orienteering problem with time windows and service time dependent profits ⋮ Efficient meta-heuristics for the multi-objective time-dependent orienteering problem ⋮ Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ Heuristics for the time dependent team orienteering problem: application to tourist route planning ⋮ Time-dependent routing problems: a review ⋮ The time-dependent orienteering problem with time windows: a fast ant colony system ⋮ The time-dependent capacitated profitable tour problem with time windows and precedence constraints ⋮ The orienteering problem: a survey ⋮ Hybridized evolutionary local search algorithm for the team orienteering problem with time windows ⋮ An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem ⋮ Solving the stochastic time-dependent orienteering problem with time windows ⋮ Optimal joint maintenance and orienteering strategy for complex mission-oriented systems: a case study in offshore wind energy ⋮ A fast solution method for the time-dependent orienteering problem

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for the TSP with sharpened triangle inequality
• On the approximability of an interval scheduling problem
• On the approximability of the traveling salesman problem (extended abstract)
• The orienteering problem
• The prize collecting traveling salesman problem
• Bicriteria Network Design Problems
• The Traveling Salesman Problem with Distances One and Two
• Efficient web searching using temporal factors

This page was built for publication: Approximation algorithms for time-dependent orienteering.