Approximation algorithms for time-dependent orienteering.

DOI10.1016/S0020-0190(01)00313-1MaRDI QIDQ1853044zbMATH OpenOpenAlexWikidataFDO

Authors 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

Approximation algorithmsNetwork designTime-depending orienteeringTraveling salesman

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1839476
• Faster algorithms for orienteering and \(k\)-TSP
• Improved algorithms for orienteering and related problems
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• Online and offline algorithms for the time-dependent TSP with time zones

Cites work

• Approximation algorithms for the TSP with sharpened triangle inequality
• Efficient web searching using temporal factors
• scientific article; zbMATH DE number 1263203 (Why is no real title available?)
• scientific article; zbMATH DE number 1445375 (Why is no real title available?)
• 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
• The Traveling Salesman Problem with Distances One and Two

Cited in

(28)

• A matheuristic approach to the orienteering problem with service time dependent profits
• The time-dependent capacitated profitable tour problem with time windows and precedence constraints
• Solving the stochastic time-dependent orienteering problem with time windows
• Online and offline algorithms for the time-dependent TSP with time zones
• Optimal joint maintenance and orienteering strategy for complex mission-oriented systems: a case study in offshore wind energy
• Faster algorithms for orienteering and \(k\)-TSP
• Time dependent orienteering problem with time windows and service time dependent profits
• An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem
• A fast solution method for the time-dependent orienteering problem
• Particle swarm optimization-based algorithms for TSP and generalized TSP
• The time-dependent orienteering problem with time windows: a fast ant colony system
• Orienteering problem with time-windows and updating delay
• Improved algorithms for orienteering and related problems
• 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
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• The Euclidean Orienteering Problem Revisited
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
• scientific article; zbMATH DE number 1839476 (Why is no real title available?)
• Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
• scientific article; zbMATH DE number 7053373 (Why is no real title available?)
• The orienteering problem: a survey
• The team orienteering problem with variable time windows
• A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
• A unifying framework for selective routing problems
• The two-visit team orienteering problem considering time-interval-dependent profits and service consistency

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853044)