更改

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

最佳的旅行推销员之旅[德国最大的15个城市。在43,589,145,600个可能的游览每个城市的旅游团中，它是最短的

最佳的旅行销售人员浏览[[德国15个最大的城市。这是43589145600次访问每个城市的可能旅行中最短的一次。]

* [[Assignment problem]]

* [[Assignment problem]]