Discounted reward TSP

DOI10.1007/S00453-016-0264-2zbMath1396.90093OpenAlexW2561922750MaRDI QIDQ1709577

Boaz Farbstein, Asaf Levin

Publication date: 6 April 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-016-0264-2

zbMATH Keywords

approximation algorithmrouting problems

Mathematics Subject Classification ID

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

Cites Work

• The directed orienteering problem
• An improved approximation ratio for the minimum latency problem
• Improved algorithms for orienteering and related problems
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• Approximation Algorithms for Orienteering and Discounted-Reward TSP

This page was built for publication: Discounted reward TSP