.png){kind=icon}
返回
Semidefinite programming based approaches to the break minimization problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2004.09.030.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper considers the break minimization problem in sports timetabling. The problem is to find, under a given timetable of a round-robin tournament, a home-away assignment that minimizes the number of breaks, i.e., the number of occurrences of consecutive matches held either both at away or both at home for a team. We formulate the break minimization problem as MAX RES CUT and MAX 2SAT, and apply Goemans and Williamson's approximation algorithm using semidefinite programming. Computational experiments show that our approach quickly generates solutions of good approximation ratios. (c) 2004 Elsevier Ltd. All rights reserved.
Keyword:
sports timetabling
approximation algorithm
semidefinite programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
Influence of Finite Element Modeling Choices in the Assessment of Stress Concentrations at Fatigue Prone Locations in Orthotropic Bridge Decks正交各向异性桥面板疲劳易发区域应力集中评估中有限元建模选择的影响
PREAI
分享收藏
分享收藏
查看更多内容