Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Set_TSP_problem> ?p ?o. }
Showing items 1 to 25 of
25
with 100 items per page.
- Set_TSP_problem abstract "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 specified disjoint subsets of the vertices of a graph. The ordinary TSP is a special case of the set TSP when all subsets to be visited are singletons. Therefore the set TSP is also NP-hard.There is a direct reduction from set TSP to asymmetric TSP, and thus from set TSP to TSP. The idea is to arbitrarily assign a directed cycle to each set. The salesman, when visiting a vertex in some set, then walks around the cycle for free. To not use the cycle would ultimately be very costly.".
- Set_TSP_problem wikiPageID "21182177".
- Set_TSP_problem wikiPageRevisionID "592752861".
- Set_TSP_problem hasPhotoCollection Set_TSP_problem.
- Set_TSP_problem subject Category:Combinatorial_optimization.
- Set_TSP_problem subject Category:Computational_problems_in_graph_theory.
- Set_TSP_problem subject Category:NP-complete_problems.
- Set_TSP_problem subject Category:Operations_research.
- Set_TSP_problem subject Category:Travelling_salesman_problem.
- Set_TSP_problem type Abstraction100002137.
- Set_TSP_problem type Attribute100024264.
- Set_TSP_problem type ComputationalProblemsInGraphTheory.
- Set_TSP_problem type Condition113920835.
- Set_TSP_problem type Difficulty114408086.
- Set_TSP_problem type NP-completeProblems.
- Set_TSP_problem type Problem114410605.
- Set_TSP_problem type State100024720.
- Set_TSP_problem comment "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 specified disjoint subsets of the vertices of a graph. The ordinary TSP is a special case of the set TSP when all subsets to be visited are singletons.".
- Set_TSP_problem label "Set TSP problem".
- Set_TSP_problem sameAs m.05b_2p8.
- Set_TSP_problem sameAs Q7456254.
- Set_TSP_problem sameAs Q7456254.
- Set_TSP_problem sameAs Set_TSP_problem.
- Set_TSP_problem wasDerivedFrom Set_TSP_problem?oldid=592752861.
- Set_TSP_problem isPrimaryTopicOf Set_TSP_problem.