274
个编辑
更改
跳到导航
跳到搜索
第227行：
第227行： + 第263行：
第264行： − −
→Specific problems
==Specific problems==
==Specific problems==
特定问题<br>
[[Image: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: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.]]
* [[Weapon target assignment problem]]
* [[Weapon target assignment problem]]
==See also==
==See also==