Discounted reward TSP

DOI10.1007/S00453-016-0264-2MaRDI QIDQ1709577zbMATH OpenOpenAlexFDO

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

Recommendations

• Reward schemes
• Discounted quotas
• Skiba points for small discount rates
• scientific article; zbMATH DE number 1804128
• Discount models
• Tullock contests reward information advantages
• Railroad discounting
• Competitively sustainable matching plans with discounting
• Optimal discounting
• Deadline TSP

Cites work

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

Cited in

(2)

• Deadline TSP
• Approximation Algorithms for Orienteering and Discounted-Reward TSP

This page was built for publication: Discounted reward TSP

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