<cite id="d9bzp"></cite>
<cite id="d9bzp"><span id="d9bzp"></span></cite>
<cite id="d9bzp"><video id="d9bzp"></video></cite><var id="d9bzp"></var>
<var id="d9bzp"><video id="d9bzp"><thead id="d9bzp"></thead></video></var>
<menuitem id="d9bzp"><video id="d9bzp"></video></menuitem>
<var id="d9bzp"></var><cite id="d9bzp"><video id="d9bzp"></video></cite>
<cite id="d9bzp"></cite>
<var id="d9bzp"></var>
<var id="d9bzp"></var>
<var id="d9bzp"><video id="d9bzp"><thead id="d9bzp"></thead></video></var>

比赛项目的排序

时间:2017-08-11 数学毕业论文 我要投稿

比赛项目的排序
 
摘要: 运动会中, 若能根据运动员的报名情况建立数学模型、科学地排定比赛项目的顺序, 使得连续参加两项比赛的运动员人次尽可能最少, 可对运动会的顺利进行提供方便;谡庵忠,本文巧妙得将运动员参赛项目的排序问题转化为图论中经典的旅行商问题求解。以连续参加两项比赛人次最少为目标,应用最小生成树求解Hamilton回路的方法,得到了题目的最优解。
关键词:项目的排序;旅行商问题;最小生成树法;Hamilton回路 
Array Items of Game
 
Abstract: In the sports meetings,if we can reduce the number of athletes who take the two games continuously by making the mathematics modelling according to the signing in condition, that will be more conveninent for sports meeting .The problem about the taxis of the competition items in sports games was transformed into the Traveling Salesman Problem in classic graph theory. In order to get the minimum times of taking part in two competitions without any interval, the minimal spanning tree algorithm to figure out a Hamilton cycle was used, In this way the Optimized answer was got.
Key words: taxis of the competition items; Hamilton cycle; Traveling Salesman Problem; minimal spanning tree

比赛项目的排序相关推荐
云南快乐十分哪个好_北京pK怎么玩-湖北快3怎么玩 千图网| 霸王别姬| 乔任梁| 火箭球星哈登改口| nba| 硼酸| 国奥| 千图网| 巴黎烟云| 死神来了2|