Pages that link to "Item:Q2475809"
From MaRDI portal
The following pages link to Round robin scheduling -- a survey (Q2475809):
Displaying 50 items.
- Edge coloring: a natural model for sports scheduling (Q323273) (← links)
- The tournament scheduling problem with absences (Q323410) (← links)
- Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm (Q342392) (← links)
- Control model for heterogeneous computational tasks based on guaranteed estimates of execution times (Q393647) (← links)
- An investigation into two bin packing problems with ordering and orientation implications (Q421577) (← links)
- A multi-round generalization of the traveling tournament problem and its application to Japanese baseball (Q421692) (← links)
- A 2.75-approximation algorithm for the unconstrained traveling tournament problem (Q475199) (← links)
- A 5.875-approximation for the traveling tournament problem (Q475212) (← links)
- Families of optimal packings in real and complex Grassmannian spaces (Q510063) (← links)
- Iterated local search with Trellis-neighborhood for the partial Latin square extension problem (Q525111) (← links)
- Constructing fair round robin tournaments with a minimum number of breaks (Q614051) (← links)
- Complexity of the traveling tournament problem (Q620946) (← links)
- Round robin tournaments and three index assignments (Q633482) (← links)
- An improved approximation algorithm for the traveling tournament problem (Q652542) (← links)
- On the application of graph colouring techniques in round-robin sports scheduling (Q709125) (← links)
- Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America (Q828758) (← links)
- Tight bounds for break minimization in tournament scheduling (Q941319) (← links)
- Score calculation from final tournament tables (Q955626) (← links)
- Scheduling sports tournaments on a single court minimizing waiting times (Q1003498) (← links)
- Minimizing costs in round robin tournaments with place constraints (Q1025238) (← links)
- Scheduling non-professional table-tennis leagues (Q1042487) (← links)
- A new neighborhood structure for round robin scheduling problems (Q1651632) (← links)
- Minimization of rest mismatches in round robin tournaments (Q1654351) (← links)
- Scheduling the South American qualifiers to the 2018 FIFA world cup by integer programming (Q1683156) (← links)
- The stable tournament problem: matching sports schedules with preferences (Q1728308) (← links)
- Scheduling double round-robin tournaments with divisional play using constraint programming (Q1751946) (← links)
- An optimization approach to designing a baseball scout network (Q1752145) (← links)
- When sports rules go awry (Q1752815) (← links)
- Complexity of the unconstrained traveling tournament problem (Q1755839) (← links)
- An ILS heuristic for the traveling tournament problem with predefined venues (Q1761896) (← links)
- An approximation algorithm for the traveling tournament problem (Q1761909) (← links)
- A Lagrangian approach for minimum cost single round robin tournaments (Q1762030) (← links)
- On the separation in 2-period double round robin tournaments with minimum breaks (Q1762158) (← links)
- Scheduling asynchronous round-robin tournaments (Q1785478) (← links)
- Approximation algorithms for \(\mathrm{TTP(2)}\) (Q1935936) (← links)
- Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021 (Q2163749) (← links)
- Effort comparisons for a class of four-player tournaments (Q2171849) (← links)
- Determining matchdays in sports league schedules to minimize rest differences (Q2183190) (← links)
- Let's meet as usual: do games played on non-frequent days differ? Evidence from top European soccer leagues (Q2184172) (← links)
- OR analysis of sporting rules -- a survey (Q2255881) (← links)
- The traveling tournament problem with predefined venues (Q2268523) (← links)
- RobinX: a three-field classification and unified data format for round-robin sports timetabling (Q2273913) (← links)
- Proactive and reactive strategies for football league timetabling (Q2282571) (← links)
- Competitive strategies for an online generalized assignment problem with a service consecution constraint (Q2355803) (← links)
- Adaptive tabu search for course timetabling (Q2379550) (← links)
- Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaks (Q2450701) (← links)
- Fair referee assignments for professional football leagues (Q2475851) (← links)
- A new branch-and-price algorithm for the traveling tournament problem (Q2655609) (← links)
- A tabu search algorithm with controlled randomization for constructing feasible university course timetables (Q2664347) (← links)
- A greedy algorithm for the social golfer and the Oberwolfach problem (Q2670589) (← links)