Ignore this box please.
More
Settings
Goodies
About
Help
Feedback
PRIVACY
DontTrack
DontBubble
Policy
COMMUNITY
Platform
Forum
Chat
Spread
Search syntax
s:d sort by date
r:uk uk region
site: domain search
\ search first result
More...
r:n turn off region
!a search search amazon
site:uk uk pages
f: find files
t: within title
b: within body
More explanation...
Set TSP problem
In combinatorial optimization, the set TSP, also known as the, 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 disjoint subsets of the vertices of a graph.
More at Wikipedia
Travelling salesman problem
Computational problems in graph theory
More related topics
Combinatorial optimization
NP-complete problems
Operations research
This page requires Javascript.Get the non-JS version
here
.