An ILS heuristic for the traveling tournament problem with predefined venues
From MaRDI portal
Publication:1761896
DOI10.1007/S10479-010-0719-9zbMATH Open1251.90127OpenAlexW2059343335MaRDI QIDQ1761896FDOQ1761896
Sebastián Urrutia, Celso C. Ribeiro, Fabrício N. Costa
Publication date: 15 November 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-010-0719-9
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The traveling tournament problem with predefined venues
- Scheduling in Sports
- Scheduling in sports: an annotated bibliography
- Heuristics for the mirrored traveling tournament problem
- A simulated annealing approach to the traveling tournament problem
- Round robin scheduling -- a survey
- Scheduling non-professional table-tennis leagues
- Minimization of the number of breaks in sports scheduling problems using constraint programming
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Cited In (8)
- Sports scheduling: Problems and applications
- A multi-round generalization of the traveling tournament problem and its application to Japanese baseball
- Complexity of the unconstrained traveling tournament problem
- Round-robin scheduling with regard to rest differences
- Edge coloring: a natural model for sports scheduling
- A variable neighborhood search method for solving the traveling tournaments problem
- A new neighborhood structure for round robin scheduling problems
- Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021
This page was built for publication: An ILS heuristic for the traveling tournament problem with predefined venues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761896)
