The garage sale problem. On a given Sunday morning, there are n garage sales going on, g1; g2,..., gn. For each garage sale gj, you have an estimate of its value to you, vj . For any two garage sales you have an estimate of the transportation cost dij of getting from gi to gj. You are also given the costs d0j and dj0 of going between your home and each garage sale. You want to find a tour of a subset of the given garage sales, starting and ending at home, that maximizes your total benefit minus your total transportation costs. Give an algorithm that solves this problem in time O (n22n). (Hint: This is closely related to the traveling salesman problem.)
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.