20,99 €
inkl. MwSt.
Versandfertig in 6-10 Tagen
10 °P sammeln
Andere Kunden interessierten sich auch für
![Development of an Algorithm for Solving TSP]( "Development of an Algorithm for Solving TSP")
Development of an Algorithm for Solving TSP34,99 €![Biobjective combinatorial optimization and the TSP with profits]( "Biobjective combinatorial optimization and the TSP with profits")
Biobjective combinatorial optimization and the TSP with profits53,99 €![Los algoritmos genéticos desde la investigación de operaciones]( "Los algoritmos genéticos desde la investigación de operaciones")
Los algoritmos genéticos desde la investigación de operaciones45,99 €![Problem of Apollonius]( "Problem of Apollonius")
Problem of Apollonius33,99 €![Search Problem]( "Search Problem")
Search Problem23,99 €![Problem of Apollonius]( "Problem of Apollonius")
Problem of Apollonius31,99 €![Tarski's Circle-Squaring Problem]( "Tarski's Circle-Squaring Problem")
Tarski's Circle-Squaring Problem20,99 €
High Quality Content by WIKIPEDIA articles! 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 (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.