A Benders approach for computing lower bounds for the mirrored traveling tournament problem-Reference-Cited by-同舟云学术

A Benders approach for computing lower bounds for the mirrored traveling tournament problem

Published:2009-05 Issue:2 Volume:6 Page:189-196
ISSN:1572-5286
Container-title:Discrete Optimization
language:en
Short-container-title:Discrete Optimization

Author:

Cheung Kevin K.H.

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science

Reference20 articles.

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

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

3. 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

4. Heuristics for the mirrored traveling tournament problem;Ribeiro;European Journal of Operational Research,2007

5. Solving the traveling tournament problem: A combined integer programming and constraint programming approach;Easton,2003

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

1. A traditional Benders’ approach to sports timetabling;European Journal of Operational Research;2023-06

2. Logic-Based Benders Decomposition for Large-Scale Optimization;Springer Optimization and Its Applications;2019

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

4. An Application of the Traveling Tournament Problem: The Argentine Volleyball League;Interfaces;2012-06

5. Integrated Methods for Optimization;International Series in Operations Research & Management Science;2012