= Traveling purchaser problem
{wiki=Traveling_purchaser_problem}
The Traveling Purchaser Problem (TPP) is a combinatorial optimization problem that is a variant of the well-known Traveling Salesman Problem (TSP). In the TPP, the objective is to identify the most efficient route for a purchaser who needs to buy a set of items from different locations while minimizing the total cost. This cost includes not only the travel costs between locations but also the prices of the items being purchased.
Back to article page
