Definitions from Wikipedia (Set TSP problem)

▸ noun:  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, whereby it is required to find a shortest tour in a graph which visits all specified subsets of the vertices of a graph.


▸ Words similar to set tsp problem
▸ Usage examples for set tsp problem

▸ Idioms related to set tsp problem
▸ Wikipedia articles (New!)
▸ Words that often appear near set tsp problem
▸ Rhymes of set tsp problem

▸ Invented words related to set tsp problem