Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Set TSP problem

Known as: Set TSP, Group TSP, One-of-a-Set TSP 
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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
The accurate and efficient operation of many applications and protocols in wireless sensor networks require synchronized notion… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
2014
2014
Synchronization to an external time source such as Coordinated Universal Time (UTC), i.e., external synchronization, while… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 7
Is this relevant?
2011
2011
A general transposed series-parallel topology of a switched-capacitor converter is presented and analyzed in this paper. This… Expand
  • figure 3
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2009
2009
The traveling salesman problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
A novel particle swarm optimization (PSO)-based algorithm for the traveling salesman problem (TSP) is presented. An uncertain… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
2007
2007
In this paper we present an exact algorithm for the Windy General Routing Problem. This problem generalizes many important Arc… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Abstract.We prove that various geometric covering problems related to the Traveling Salesman Problem cannot be efficiently… Expand
  • table 1.1
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
Is this relevant?
2004
2004
A novel discrete particle swarm optimization (PSO) method is presented to solve the generalized traveling salesman problem (GTSP… Expand
  • figure 2
  • figure 1
  • table 1
  • figure 7
Is this relevant?
2003
2003
Consider the traveling salesman problem where the distance between two cities A and B is an integrable function of the y… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Abstract The generalized traveling salesman problem (GTSP) is a generalization of the traveling salesman problem (TSP), one of… Expand
Is this relevant?