travelling salesman problem
1Travelling Salesman Problem — [ trævəlɪȖ seɪlzmən prɔbləm, englisch], Problem des Handelsreisenden, Rundfahrtproblem, Operations Research: kombinatorisches Optimierungsproblem, bei dem durch eine vorgegebene Menge von Orten von einem bestimmten Ausgangsort aus der kürzeste… …
2Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… …
3Travelling-Salesman-Problem — Optimaler Reiseweg eines Handlungsreisenden durch die 15 größten Städte Deutschlands. Die angegebene Route ist die kürzeste von 43.589.145.600 möglichen. Das Problem des Handlungsreisenden (engl. Traveling Salesman Problem, kurz TSP) ist ein …
4Travelling Salesman Problem — Optimaler Reiseweg eines Handlungsreisenden durch die 15 größten Städte Deutschlands. Die angegebene Route ist die kürzeste von 43.589.145.600 möglichen. Das Problem des Handlungsreisenden (engl. Traveling Salesman Problem, kurz TSP) ist ein …
5travelling salesman problem — noun The problem in combinatorial optimization in which, given a number of cities and the costs of travelling from one to the other, it is required to determine the cheapest route that visits each city once and then returns to the initial city …
6Travelling salesman (disambiguation) — A travelling salesman is a travelling vendor of goods.Travelling salesman may also refer to:* Traveling Saleseman (film), a 1921 comedy film * Traveling Salesmen ( The Office episode), the twelfth episode of the third season of the US version of… …
7Bottleneck traveling salesman problem — The Bottleneck traveling salesman problem (bottleneck TSP) is a problem in discrete or combinatorial optimization. It is stated as follows: Find the Hamiltonian cycle in a weighted graph with the minimal weight of the most weighty edge of the… …
8Function problem — In computational complexity theory, a function problem is a problem other than a decision problem, that is, a problem requiring a more complex answer than just YES or NO.Notable examples include the travelling salesman problem, which asks for the …
9P versus NP problem — Unsolved problems in computer science Is P = NP ? …
10Job-shop problem — The job shop problem (JSP) is a problem in discrete or combinatorial optimization, and is a generalization of the famous travelling salesman problem. It is a prominent illustration of a class of problems in computational complexity theory which… …
