A 2.75-approximation algorithm for the unconstrained traveling tournament problem
暂无分享,去创建一个
[1] Tomomi Matsui,et al. An Improved Approximation Algorithm for the Traveling Tournament Problem , 2011, Algorithmica.
[3] Stephan Westphal,et al. Complexity of the traveling tournament problem , 2011, Theor. Comput. Sci..
[4] Stephan Westphal,et al. A 5.875-approximation for the Traveling Tournament Problem , 2014, Ann. Oper. Res..
[5] Celso C. Ribeiro,et al. Maximizing breaks and bounding solutions to the mirrored traveling tournament problem , 2006, Discret. Appl. Math..
[6] Stephan Westphal,et al. Approximating the Traveling Tournament Problem with Maximum Tour Length 2 , 2010, ISAAC.
[7] George L. Nemhauser,et al. The Traveling Tournament Problem Description and Benchmarks , 2001, CP.
[8] Michael A. Trick,et al. Round robin scheduling - a survey , 2008, Eur. J. Oper. Res..
[9] Tomomi Matsui,et al. Constructive Algorithms for the Constant Distance Traveling Tournament Problem , 2006, PATAT.
[10] Rishiraj Bhattacharyya,et al. A Note on Complexity of Traveling Tournament Problem , 2009 .
[11] Celso C. Ribeiro,et al. Scheduling in sports: An annotated bibliography , 2010, Comput. Oper. Res..
[12] Tomomi Matsui,et al. An approximation algorithm for the traveling tournament problem , 2012, Ann. Oper. Res..