In the theory of computational complexity, the travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances...

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...

307 cards in the set. ^XV : In the Time Spiral Cycle there are special cards in each set that are "timeshifted". In Time Spiral TSP refers to all non-timeshifted...

Look up TSP or tsp in Wiktionary, the free dictionary. TSP or tsp may refer to: Tropical spastic paraparesis, weakness due to T-lymphotropic virus infection...

generalises the travelling salesman problem (TSP), which is equivalent to requiring a single route to visit all locations. As the TSP is NP-hard, the VRP is also...

travelling salesman problem ("TSP"), the minimum spanning tree problem ("MST"), and the knapsack problem. In many such problems, such as the ones previously...

absolute geometry and even weaker settings. Set TSP problem, a more general task of visiting each of a family of sets by the shortest tour Dörrie, Heinrich...

specific set of vertices to be included in the path, which makes the problem similar to the Traveling Salesman Problem (TSP). The TSP is the problem of finding...

and Karp to solve the traveling salesman problem (TSP), in which the input is a distance matrix between a set of cities, and the goal is to find a minimum-length...

(2007), Lin, Guohui (ed.), "An Improved Exact Algorithm for Cubic Graph TSP", Computing and Combinatorics, Lecture Notes in Computer Science, vol. 4598...

to the respective distances of the TSP instance. Many other problems of standard combinatorial optimization problems may be written in this form. In addition...

Arc routing problems (ARP) are a category of general routing problems (GRP), which also includes node routing problems (NRP). The objective in ARPs and...

job-shop problem with sequence-dependent setup is also NP-hard since the TSP is a special case of the JSP with a single job (the salesman in TSP) and the...

An inverse problem in science is the process of calculating from a set of observations the causal factors that produced them: for example, calculating...

Euclidean TSP. Methods based on the Christofides–Serdyukov algorithm can also be used to approximate the stacker crane problem, a generalization of the TSP in...

should not be greedy: Domination analysis of greedy-type heuristics for the TSP". Discrete Applied Mathematics. 117 (1–3): 81–86. doi:10.1016/S0166-218X(01)00195-0...

approximation is described by Jon Bentley for solving the travelling salesman problem (TSP): "Given a list of cities and the distances between each pair of cities...

Exponential Neighborhoods and Domination Analysis for the TSP, in The Traveling Salesman Problem and Its Variations, G. Gutin and A.P. Punnen (eds.), Kluwer...

the traveling salesman problem. When the costs of the arcs are infinite and the ring contains all nodes, the RSP reduces to TSP. Some applications of RSP...

benchmark datasets for the vertex k-center problem are the pmed instances from OR-Lib., and some instances from TSP-Lib. Table 1 shows the mean and standard...

publicized the name Traveling salesman problem (TSP) within the mathematical community at mass. He publicized the TSP in 1948 by presenting it at the RAND...

number of NP-hard problems: Integer programming Nonlinear programming Travelling salesman problem (TSP) Quadratic assignment problem (QAP) Maximum satisfiability...

(line 28). The traveling salesman problem (TSP) is sometimes used to show the functionality of tabu search. This problem poses a straightforward question:...

S2CID 4401537. Xiao, Mingyu; Nagamochi, Hiroshi (2013), "An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity...

1996). "Polynomial time approximation schemes for Euclidean TSP and other geometric problems". Proceedings of 37th Conference on Foundations of Computer...

Woeginger, Gerhard (2016), "Fine-Grained Complexity Analysis of Two Classic TSP Variants", in Chatzigiannakis, Ioannis; Mitzenmacher, Michael; Rabani, Yuval;...

{\displaystyle {\mathcal {NP}}} -hard problems (such as mixed integer programming, CSP, AI planning, TSP, MAXSAT, QBF and answer set programming). Competition-winning...

pheromone deposited by k {\displaystyle k} th ant, typically given for a TSP problem (with moves corresponding to arcs of the graph) by Δ τ x y k = { Q /...

representative of the first task type is the traveling salesman problem (TSP), where the goal is to visit a set of cities exactly once on the shortest tour. An example...

problem, the vehicle routing problem and the ring star problem are three generalizations of TSP. The decision version of the TSP (where given a length L,...