SP6503 TSPAGAIN - Travelling Salesman Again !

There are N cities numbered from 0..N-1. A salesman is located at city 0. He wishes to visit all cities exactly once and return back to city 0. There are K toll booths. Each toll booth has a certain range of functioning. The parameters for toll k are given as x\_k and y\_k. If the salesman travels from city i to j, he has to pay 1 dollar toll fee to each toll p having x\_p >= i and y\_p

N/A

N/A