文章基本信息

标题：Optimization of Hamilton Path Tournament Schedule
本地全文：下载
作者：Trinetra Kumar Pathak ; Vinod Kumar Bhalla
期刊名称：International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN：2278-1323
出版年度：2013
卷号：2
期号：6
页码：2091-2094
出版社：Shri Pannalal Research Institute of Technolgy
摘要：A Hamilton path tournament design involving n teams and n/2 stadiums, is a round robin schedule on n . 1 days in which each team plays in each stadium at most twice, and the set of games played in each stadium induce a Hamilton path on n teams[1]. We have created an algorithm to calculate the cost of all pairs which is generated using Hamilton path tournament Design [1] that work on n teams, ,n/2 stadiums and n . 1 days schedule in which each team played at most twice in each stadium [1]. In our algorithm, we have calculated the cost of each combination of pairs and choose the Optimize Hamilton path tournament.
关键词：Cost; Combination; Schedule; Path