更改

==特定问题==

==特定问题==

[[Image:300px-TSP_Deutschland_3.png|thumb|200px|An optimal traveling salesperson tour through [[Germany]]’s 15 largest cities. It is the shortest among 43,589,145,600<ref>Take one city, and take all possible orders of the other 14 cities. Then divide by two because it does not matter in which direction in time they come after each other: 14!/2 = 43,589,145,600.</ref> possible tours visiting each city exactly once.]]

[[Image:300px-TSP_Deutschland_3.png|thumb|200px|德国15个最大城市的最佳旅行推销员之旅。最优的旅行商途经德国15个最大的城市。在43,589,145,600个可能的游览每个城市的旅行团中，这是最短的一个。]]

 

An optimal traveling salesperson tour through [[Germany’s 15 largest cities. It is the shortest among 43,589,145,600 possible tours visiting each city exactly once.]]

 

最优的旅行商途经[[德国15个最大的城市。这是每个城市只能访问一次的43589145600<ref>Take one city, and take all possible orders of the other 14 cities. Then divide by two because it does not matter in which direction in time they come after each other: 14!/2 = 43,589,145,600.</ref>次旅行中最短的一次。]

* '''指派问题 Assignment Problem'''

* '''指派问题 Assignment Problem'''