| 非直接对抗性项目竞赛日程编排方法的研究 |
| |
| 引用本文： | 李良刚,杨莉.非直接对抗性项目竞赛日程编排方法的研究[J].四川体育科学,2001(3):40-42. |
| |
| 作者姓名： | 李良刚 杨莉 |
| |
| 作者单位： | 1. :成都体育学院
2. :成都西北中学 |
| |
| 摘 要： | 竞赛日程是运动员、裁判员进行比赛和工作的依据,合理的竞赛日程对比赛有十分重要的作用,但日程安排是一件非常复杂而困难的工作,因为它包含了世界上几大数学难题之一,称为NP难题.面对NP难题,当前国内竞赛日程安排缺乏科学的方法和手段,本文的目的是研究日程编排中的这一难题.
|
| 关 键 词： | 竞赛日程 NP难题 项目独立集 移动空间 |
| 文章编号： | 1007-6891(2001)03-0040-03 |
| 修稿时间： | 2001年4月16日 |
On Studies about the Arrangement Method of Competition Schedule |
| |
| LI Liang-gang,YANG Li :Chengdu Institute of Physical Education,Sichuan Chengdu,China. :Chengdu XiBei Middle School,Sichuan Chengdu,China..On Studies about the Arrangement Method of Competition Schedule[J].Sichuan Sports Science,2001(3):40-42. |
| |
| Authors: | LI Liang-gang YANG Li :Chengdu Institute of Physical Education Sichuan Chengdu China :Chengdu XiBei Middle School Sichuan Chengdu China |
| |
| Institution: | LI Liang-gang,YANG Li 1:Chengdu Institute of Physical Education,Sichuan Chengdu,610041,China. 2:Chengdu XiBei Middle School,Sichuan Chengdu,610041,China. |
| |
| Abstract: | The competition schedule is the sports staffs basis for competition. A reasonable competition schedule would play a very important role during competition, but the arrangement of schedule is very difficult to do, because it contain one of the most difficult mathematical problem in the world, which is called NP-problem (None terminostic polynomial).Facing this NP-problem, our experts have no a efficient way to deal with it. However, This research has given a method to solve successfully this problem and improve the quality and effect of competition schedule. |
| |
| Keywords: | Competition schedule NP problem independent sets of events point and move space of events |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
