A combined local search and integer programming approach to the traveling tournament problem
From MaRDI portal
Publication:284438
Recommendations
- A simulated annealing and hill-climbing algorithm for the traveling tournament problem
- Mathematical Modeling and Tabu Search Heuristic for the Traveling Tournament Problem
- scientific article; zbMATH DE number 2084735
- A simulated annealing approach to the traveling tournament problem
- A beam search approach to the traveling tournament problem
Cites work
- scientific article; zbMATH DE number 2084735 (Why is no real title available?)
- A 5.875-approximation for the traveling tournament problem
- A new branch-and-price algorithm for the traveling tournament problem
- A simulated annealing and hill-climbing algorithm for the traveling tournament problem
- A simulated annealing approach to the traveling tournament problem
- A user's guide to tabu search
- An Improved Approximation Algorithm for the Traveling Tournament Problem
- An approximation algorithm for the traveling tournament problem
- Complexity of the traveling tournament problem
- Heuristics for the mirrored traveling tournament problem
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Scheduling in Sports
- Scheduling in sports: an annotated bibliography
- Sports scheduling: problems and applications
- The traveling tournament problem with predefined venues
Cited in
(13)- Splitting a giant tour using integer linear programming
- A simulated annealing and hill-climbing algorithm for the traveling tournament problem
- Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America
- The traveling social golfer problem: the case of the Volleyball Nations League
- An ILS heuristic for the traveling tournament problem with predefined venues
- A beam search approach to the traveling tournament problem
- Mathematical Modeling and Tabu Search Heuristic for the Traveling Tournament Problem
- DFS* and the Traveling Tournament Problem
- Determining the results of tournament games using complete graphs generation
- A simulated annealing approach to the traveling tournament problem
- Constructing competitive tours from local information
- scientific article; zbMATH DE number 2084735 (Why is no real title available?)
- Decomposition and local search based methods for the traveling umpire problem
This page was built for publication: A combined local search and integer programming approach to the traveling tournament problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284438)