Bei uns finden Sie zahlreiche Produkte von namhaften Herstellern auf Lager. Wähle aus unserer großen Auswahl an diversen Büchern. Jetzt online shoppen!
Suchergebnisse
Suchergebnisse:
This is called the Travelling Salesman Problem. It has to be solved not only in transportation and logistics, but also when positioning transistors on microchips, to make faster computers, or when analysing the structure of DNA. One simple method would be to try all possible paths, finding the length of each, and then picking the shortest one.
The Traveling Salesman Problem (often called TSP) is a classic algorithmic problem in the field of computer science and operations research. [1] It is focused on optimization. In this context, better solution often means a solution that is cheaper, shorter, or faster. TSP is a mathematical problem. It is most easily expressed as a graph ...
The Traveling Saleswoman is a 1950 American Western comedy film directed by Charles Reisner and starring Joan Davis, Andy Devine, Adele Jergens, Joe Sawyer, and Dean Riesner. The film was released by Columbia Pictures on February 15, 195 ...
Travelling Salesman is a 2012 intellectual thriller film about four mathematicians who solve the P versus NP problem, one of the most challenging mathematical problems in history. The title refers to the travelling salesman problem , an optimization problem that acts like a key to solving other difficult mathematical problems.
旅行推销员问题. 旅行商问题 （英語： Travelling salesman problem ，縮寫： TSP ）是 组合优化 中的一个 NP困难 问题，在 运筹学 和 理论计算机科学 中非常重要。. 问题内容为“给定一系列城市和每對城市之间的距离，求解访问每座城市一次并回到起始城市的最短回路 ...
旅行推销员问题（英语：Travelling salesman problem, TSP）是这样一个问题：给定一系列城市和每对城市之间的距离，求解访问每一座城市一次并回到起始城市的最短回路。它是组合优化中的一个NP难问题，在运筹学和理论计算机科学中非常重要。
Vor 4 Tagen · The traveling salesman problem is a problem in graph theory requiring the most efficient (i.e., least total distance) Hamiltonian cycle a salesman can take through each of n cities. No general method of solution is known, and the problem is NP-hard. The Wolfram Language command FindShortestTour[g] attempts to find a shortest tour, which is a Hamiltonian cycle (with initial vertex repeated at ...
