A traveling salesman has to start from city A, cover all other n number of cities, and then come back to city A. The distance between the ith and jth cities is given by yij. How could he plan the route so to cover the minimum distance? Formulate this as an optimization problem