Solving mirrored traveling tournament problem benchmark instances with eight teams-Reference-Cited by-同舟云学术

Solving mirrored traveling tournament problem benchmark instances with eight teams

Published:2008-02 Issue:1 Volume:5 Page:138-143
ISSN:1572-5286
Container-title:Discrete Optimization
language:en
Short-container-title:Discrete Optimization

Author:

Cheung K.K.H.

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science

Reference16 articles.

1. A simulated annealing approach to the traveling tournament problem;Anagnostopoulos;Journal of Scheduling,2006

2. T. Benoist, F. Laburthe, B. Rottembourg, Lagrange relaxation and constraint programming collaborative schemes for traveling tournament problems, in: Proceedings CPAIOR’01, Wye College (Imperial College), Ashford, Kent, UK, 2001, pp. 15–26

3. Solutions of problems: Group theory: 8;Dickson;The American Mathematical Monthly,1906

4. There are 526,915,620 non-isomorphic one-factorizations of K12;Dinitz;Journal of Combinatorial Designs,1994

5. The traveling tournament problem: Description and benchmarks;Easton,2001

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. First-break-heuristically-schedule: Constructing highly-constrained sports timetables;Operations Research Letters;2023-05

2. Traveling Tournament Problem and the Different Methods of Solutions: A Brief Review;Advances in Data Science and Computing Technologies;2023

3. Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America;TOP;2020-07-13

4. New models for the Mirrored Traveling Tournament Problem;Computers & Industrial Engineering;2012-12

5. Sports scheduling: Problems and applications;International Transactions in Operational Research;2012-01