Approximation algorithms for time-dependent orienteering

DOI10.1007/3-540-44669-9_57MaRDI QIDQ4782745zbMATH OpenFDO

Authors Fedor V. Fomin, Andrzej Lingas

Publication date 2 December 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2138/21380508

zbMATH Keywords

\((2+\varepsilon)\)-approximation algorithmpolynomial timetime-dependent orienteering problemtime-dependent traveling salesman problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Approximation algorithms for time-dependent orienteering.
• scientific article; zbMATH DE number 7053373
• Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• Approximation algorithms for the arc orienteering problem
• A fast solution method for the time-dependent orienteering problem
• An Optimal Algorithm for the Orienteering Tour Problem
• scientific article; zbMATH DE number 5764858
• Improved algorithms for orienteering and related problems
• Faster algorithms for orienteering and \(k\)-TSP

Cited in

(12)

• Approximation algorithms for time-dependent orienteering.
• Online and offline algorithms for the time-dependent TSP with time zones
• Faster algorithms for orienteering and \(k\)-TSP
• A fast solution method for the time-dependent orienteering problem
• Improved algorithms for orienteering and related problems
• TSP race: minimizing completion time in time-sensitive applications
• Solving the orienteering problem with time windows via the pulse framework
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• The Euclidean Orienteering Problem Revisited
• Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
• scientific article; zbMATH DE number 7053373 (Why is no real title available?)
• Algorithms for the thief orienteering problem on directed acyclic graphs

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 Q4782745)