What is the common name of the computational problem whose task, when given a list of cities and the distances between them is to find the shortest possible tour that visits each city once?
Travelling salesman problem Travelling salesman problem The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science. The travelling purchaser problem and the vehicle routing problem are both generalizations of TSP. In the theory of computational complexity, the decision version of the TSP (where, given a length "L", the task is to decide whether the graph has any tour shorter
Shortest common supersequence problem two sequences X and Y are given and the task is to find a shortest possible common supersequence of these sequences. In general, an SCS is not unique. For two input sequences, an SCS can be formed from a longest common subsequence (LCS) easily. For example, if Xformula_1 and Yformula_2, the lcs is Zformula_3. By inserting the non-lcs symbols while preserving the symbol order, we get the SCS: Uformula_4. It is quite clear that formula_5 for two input sequences. However, for three or more input sequences this does not hold. Note also, that the lcs and the SCS problems are