A combined local search and integer programming approach to the traveling tournament problem
From MaRDI portal
Publication:284438
DOI10.1007/s10479-014-1586-6zbMath1336.90074MaRDI QIDQ284438
Marc Goerigk, Stephan Westphal
Publication date: 18 May 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1586-6
90C10: Integer programming
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America, Determining the results of tournament games using complete graphs generation, The traveling social golfer problem: the case of the Volleyball Nations League
Uses Software
Cites Work
- Unnamed Item
- A 5.875-approximation for the traveling tournament problem
- Complexity of the traveling tournament problem
- Scheduling in sports: an annotated bibliography
- Heuristics for the mirrored traveling tournament problem
- A simulated annealing approach to the traveling tournament problem
- An approximation algorithm for the traveling tournament problem
- The traveling tournament problem with predefined venues
- A user's guide to tabu search
- A simulated annealing and hill-climbing algorithm for the traveling tournament problem
- A new branch-and-price algorithm for the traveling tournament problem
- An Improved Approximation Algorithm for the Traveling Tournament Problem
- Scheduling in Sports
- Sports scheduling: Problems and applications
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems