arrow
返回

Tournament scoring problem

delete2008-05-01
delete1
PRE
AI
V
Vasif V. Nabiyev
H
Hüseyin Pehlivan *
DOI:10.1016/j.amc.2007.09.041delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In this paper, we describe a new scoring problem for tournament environments, called tournament scoring problem. Unlike classical combinatorial problems with some initial state and constraints, the described problem is concerned with the construction of valid initial states according to some given final state and constraints. The problem can easily be generalised to incorporate various sports disciplines played in both tournament and league environments. Given a football tournament, this involves determining possible scores of all matches between teams, using the final state of the tournament table. We propose a constraint-based approach to a feasible solution of the problem for football tournaments, examining the subject of multi-parameter partition and introducing the notion of black&white graphs. Using some particular table data, experimental results are also presented along with the number of different scores and their computation time. (C) 2007 Elsevier Inc. All rights reserved.
Keyword:
multi-parameter partition
mixed graphs
black&white graphs
vertex chaining

期刊

Applied Mathematics and Computation 封面图
Applied Mathematics and Computation
IF:
3.4
论文数:
2.3W
被引数:
3.3W

机构

K
karadeniz technical university
学者数:
5.2K
论文数: 4.2K
被引数: 38
引用论文

引用论文

Family Engagement Within Schoolwide Positive Behavioral Interventions and Supports
err2015-04-22
err0
PREAI
errS. Andrew Garbacz; Kent McIntosh; John W. Eagle; Shannon E. Dowd-Eagle; Kara A. Hirano; Traci Ruppert
err分享
err收藏
err分享
err收藏
A tournament problem
err2003-02-01
err0
PREAI
errM.H. Eggar
err分享
err收藏
没有更多内容