Suppose we are given a graph with distances for each of the edges and merit for each of the nodes. What are the best (approximation) algorithms for computing the the most meritorious simple path with a cap on the maximum distance allowed?
Approximation Algorithm for TSP-like problem
approximation algorithms;optimization;tsp