Scheduling in sports: an annotated bibliography
From MaRDI portal
Publication:733513
DOI10.1016/j.cor.2009.05.013zbMath1171.90400WikidataQ59569454 ScholiaQ59569454MaRDI QIDQ733513
Graham Kendall, Sigrid Knust, Sebastián Urrutia, Celso Carneiro Ribeiro
Publication date: 16 October 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.05.013
integer programming; scheduling; metaheuristics; local search; tournaments; constraint programming; traveling tournament problem; sports; referee assignment
90C05: Linear programming
90B35: Deterministic scheduling theory in operations research
90B90: Case-oriented studies in operations research
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications, Sports scheduling: Problems and applications, Mathematical programming as a tool for virtual soccer coaches: a case study of a fantasy sport game, Referee assignment in the Chilean football league using integer programming and patterns, ON THE GROWTH OF MAXIMAL BREAK INTERVALS OF EQUITABLE ROUND-ROBIN TOURNAMENTS, Simultaneous scheduling of football games and referees using Turkish league data, A combined local search and integer programming approach to the traveling tournament problem, Decomposition and local search based methods for the traveling umpire problem, Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem, Edge coloring: a natural model for sports scheduling, The tournament scheduling problem with absences, Scheduling the professional Ecuadorian football league by integer programming, Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm, Breaks, cuts, and patterns, An investigation into two bin packing problems with ordering and orientation implications, A multi-round generalization of the traveling tournament problem and its application to Japanese baseball, A 2.75-approximation algorithm for the unconstrained traveling tournament problem, A 5.875-approximation for the traveling tournament problem, Assigning judges to competitions of several rounds using tabu search, Complexity of the traveling tournament problem, On the application of graph colouring techniques in round-robin sports scheduling, Optimization in dubbing scheduling, Multicriteria models for planning power-networking events, Assignment of swimmers to events in a multi-team meeting for team global performance optimization, A new neighborhood structure for round robin scheduling problems, Scheduling the South American qualifiers to the 2018 FIFA world cup by integer programming, The sport teams grouping problem, When sports rules go awry, Complexity of the unconstrained traveling tournament problem, An ILS heuristic for the traveling tournament problem with predefined venues, Comparing league formats with respect to match importance in Belgian football, A Lagrangian approach for minimum cost single round robin tournaments, On the separation in 2-period double round robin tournaments with minimum breaks, Round-robin tournaments generated by the circle method have maximum carry-over, Approximation algorithms for \(\mathrm{TTP(2)}\), Let's meet as usual: do games played on non-frequent days differ? Evidence from top European soccer leagues, OR analysis of sporting rules -- a survey, RobinX: a three-field classification and unified data format for round-robin sports timetabling, Proactive and reactive strategies for football league timetabling, Handling fairness issues in time-relaxed tournaments with availability constraints, Scheduling a non-professional indoor football league: a tabu search based approach, Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic, On the score sheets of a round-robin football tournament, A complete search method for the relaxed traveling tournament problem, ON THE GENERALIZED MIRRORED SCHEME FOR DOUBLE ROUND ROBIN TOURNAMENTS IN SPORTS SCHEDULING, Benders' cuts guided large neighborhood search for the traveling umpire problem, Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over
