A combined local search and integer programming approach to the traveling tournament problem
From MaRDI portal
Publication:284438
DOI10.1007/S10479-014-1586-6zbMATH Open1336.90074OpenAlexW2021791623MaRDI QIDQ284438FDOQ284438
Authors: 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
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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
- A user's guide to tabu search
- An approximation algorithm for the traveling tournament problem
- The traveling tournament problem with predefined venues
- 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
- Title not available (Why is that?)
- A 5.875-approximation for the traveling tournament problem
- Sports scheduling: problems and applications
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- 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
Cited In (13)
- 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
- Title not available (Why is that?)
- Decomposition and local search based methods for the traveling umpire problem
- A simulated annealing approach to the traveling tournament problem
- Constructing competitive tours from local information
- A beam search approach to the traveling tournament problem
- Splitting a giant tour using integer linear programming
- A simulated annealing and hill-climbing algorithm for the traveling tournament problem
- An ILS heuristic for the traveling tournament problem with predefined venues
- DFS* and the Traveling Tournament Problem
- Mathematical Modeling and Tabu Search Heuristic for the Traveling Tournament Problem
- Determining the results of tournament games using complete graphs generation
Uses Software
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)