首页> 外文会议>International Conference on Algorithmic Applications in Management(AAIM 2005); 20050622-25; Xian(CN) >Semidefinite Programming Based Approaches to Home-Away Assignment Problems in Sports Scheduling
【24h】

Semidefinite Programming Based Approaches to Home-Away Assignment Problems in Sports Scheduling

机译:基于半定规划的运动调度中归属分配问题的方法

获取原文
获取原文并翻译 | 示例

摘要

For a given schedule of a round-robin tournament and a matrix of distances between homes of teams, an optimal home-away assignment problem is to find a home-away assignment that minimizes the total traveling distance. We propose a technique to transform the problem to MIN RES CUT. We apply Goemans and Williamson's 0.878-approximation algorithm for MAX RES CUT, which is based on a positive semidefinite programming relaxation, to the obtained MIN RES CUT instances. Computational experiments show that our approach quickly generates solutions of good approximation ratios.
机译:对于给定的循环赛赛程和球队两队之间的距离矩阵,最佳的离家出走分配问题是找到使总旅行距离最小的离家出走分配。我们提出了一种将问题转换为MIN RES CUT的技术。对于获得的MIN RES CUT实例,我们将基于正半定编程松弛的Goemans和Williamson的0.878近似算法用于MAX RES CUT。计算实验表明,我们的方法可以快速生成具有良好近似率的解。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号