An Application of Assignment Problem in Traveling Salesman Problem (TSP)

摘要

Assignment problem (AP) is completely degenerate form of a transportation problem. It appears in so me decision-making situations, this paper focused on TSP for finding the shortest closed route. By using .ROA Method. and .Ghadle and Muley Rule. will get optimal solution for TSP within few steps