{"version":"1.0","type":"link","title":"Set TSP problem - Newikis","description":"In combinatorial optimization, the set TSP, also known as the generalized TSP, group TSP, One-of-a-Set TSP, Multiple Choice TSP or Covering Salesman Problem, is a generalization of the traveling salesman problem (TSP), whereby it is required to find a shortest tour in a graph which visits all…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}