A simulated annealing approach to the traveling tournament problem
From MaRDI portal
(Redirected from Publication:880541)
Recommendations
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- A simulated annealing and hill-climbing algorithm for the traveling tournament problem
- A combined local search and integer programming approach to the traveling tournament problem
- A variable neighborhood search method for solving the traveling tournaments problem
- Mathematical Modeling and Tabu Search Heuristic for the Traveling Tournament Problem
Cites work
- A tabu search heuristic for the generalized assignment problem
- General Purpose Simulated Annealing
- scientific article; zbMATH DE number 2084735 (Why is no real title available?)
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Optimization by simulated annealing
- Tabu search for the multilevel generalized assignment problem
- TSP ejection chains
Cited in
(45)- A Benders approach for computing lower bounds for the mirrored traveling tournament problem
- A new neighborhood structure for round robin scheduling problems
- The sport teams grouping problem
- Complexity of the unconstrained traveling tournament problem
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- An ILS heuristic for the traveling tournament problem with predefined venues
- An approximation algorithm for the traveling tournament problem
- On the separation in 2-period double round robin tournaments with minimum breaks
- Approximation algorithms for \(\mathrm{TTP(2)}\)
- A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.
- A beam search approach to the traveling tournament problem
- Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021
- The traveling tournament problem with predefined venues
- Scheduling sports competitions at multiple venues -- revisited
- Round robin scheduling -- a survey
- Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
- A simulated annealing and hill-climbing algorithm for the traveling tournament problem
- A complete search method for the relaxed traveling tournament problem
- Scheduling fixtures for basketball New Zealand
- A variable neighborhood search method for solving the traveling tournaments problem
- A further improvement on approximating TTP-2
- A combined local search and integer programming approach to the traveling tournament problem
- Edge coloring: a natural model for sports scheduling
- Sports scheduling search space connectivity: a riffle shuffle driven approach
- A multi-round generalization of the traveling tournament problem and its application to Japanese baseball
- A 5.875-approximation for the traveling tournament problem
- Sports scheduling: problems and applications
- Scheduling fixtures for New Zealand Cricket
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Confection de calendriers de matchs pour le sport universitaire et collégial au Québec
- A novel non-linear approach to minimal area rectangular packing
- Complexity of the traveling tournament problem
- Round robin tournaments and three index assignments
- The traveling tournament problem: improved algorithms based on cycle packing
- A matching-based approximation algorithm for the traveling tournament problem
- On the initial transition of graphs of Kirkman schedules by the partial team swap
- Which algorithm to select in sports timetabling?
- A 5-approximation algorithm for the traveling tournament problem
- On the application of graph colouring techniques in round-robin sports scheduling
- A Monte Carlo framework for procedural fixture fairness evaluation in league competitions
- Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America
- The timetable constrained distance minimization problem
- Heuristics for the mirrored traveling tournament problem
- Optimization in dubbing scheduling
- Solving mirrored traveling tournament problem benchmark instances with eight teams
This page was built for publication: A simulated annealing 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 Q880541)