We extend the (1 — 1/e)-approximation algorithm to a constant-factor approximation algorithms for a nonseparable assignment problem with applications in maximizing revenue for budget-constrained ...

The Traveling Salesman Problem with Backhauls (TSPB) is defined on a graph G = (V, E). The vertex set is partitioned into V=({v1},L,B), where v1 is a depot, L is a set of linehaul customers, and B is ...