更改

[[File:Minimum spanning tree.svg|thumb|300px|right|一个加权平面图的'''最小[[生成树]] Minimum Spanning Tree'''。找到最小[[生成树]]是一个涉及'''组合优化 Combinatorial Optimization'''的常见问题。

[[File:Minimum spanning tree.svg.png|thumb|300px|right|一个加权平面图的'''最小[[生成树]] Minimum Spanning Tree'''。找到最小[[生成树]]是一个涉及'''组合优化 Combinatorial Optimization'''的常见问题。

]]

]]

==特定问题==

==特定问题==

[[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: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.]]

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.]]

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.]]