The following pages link to (Q4475665):
Displaying 50 items.
- A combined local search and integer programming approach to the traveling tournament problem (Q284438) (← links)
- Decomposition and local search based methods for the traveling umpire problem (Q296910) (← links)
- Edge coloring: a natural model for sports scheduling (Q323273) (← 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)
- A note on symmetry reduction for circular traveling tournament problems (Q531484) (← 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)
- The timetable constrained distance minimization problem (Q846138) (← links)
- A Benders approach for the constrained minimum break problem (Q856212) (← links)
- Heuristics for the mirrored traveling tournament problem (Q863992) (← links)
- A simulated annealing approach to the traveling tournament problem (Q880541) (← links)
- Solving mirrored traveling tournament problem benchmark instances with eight teams (Q924643) (← links)
- On the existence of sports schedules with multiple venues (Q944723) (← links)
- A Benders approach for computing lower bounds for the mirrored traveling tournament problem (Q1015323) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- A new neighborhood structure for round robin scheduling problems (Q1651632) (← links)
- Minimization of rest mismatches in round robin tournaments (Q1654351) (← links)
- Scheduling Argentina's professional basketball leagues: a variation on the travelling tournament problem (Q1719646) (← links)
- The stable tournament problem: matching sports schedules with preferences (Q1728308) (← links)
- The sport teams grouping problem (Q1730756) (← links)
- Scheduling double round-robin tournaments with divisional play using constraint programming (Q1751946) (← links)
- Complexity of the unconstrained traveling tournament problem (Q1755839) (← links)
- A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
- An ILS heuristic for the traveling tournament problem with predefined venues (Q1761896) (← links)
- An approximation algorithm for the traveling tournament problem (Q1761909) (← links)
- An XML format for benchmarks in high school timetabling (Q1761916) (← links)
- On the separation in 2-period double round robin tournaments with minimum breaks (Q1762158) (← links)
- Approximation algorithms for \(\mathrm{TTP(2)}\) (Q1935936) (← links)
- A beam search approach to the traveling tournament problem (Q2057120) (← links)
- Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021 (Q2163749) (← 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)
- Scheduling a non-professional indoor football league: a tabu search based approach (Q2327697) (← links)
- Competitive strategies for an online generalized assignment problem with a service consecution constraint (Q2355803) (← links)
- Scheduling sports competitions at multiple venues -- revisited (Q2432843) (← links)
- Round robin scheduling -- a survey (Q2475809) (← links)
- Maximizing breaks and bounding solutions to the mirrored traveling tournament problem (Q2500541) (← links)
- A simulated annealing and hill-climbing algorithm for the traveling tournament problem (Q2503219) (← links)
- A complete search method for the relaxed traveling tournament problem (Q2513735) (← links)
- A new branch-and-price algorithm for the traveling tournament problem (Q2655609) (← links)
- A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem (Q2684046) (← links)
- A further improvement on approximating TTP-2 (Q2695281) (← links)
- Benders' cuts guided large neighborhood search for the traveling umpire problem (Q2892136) (← links)
- Coloration de graphes : fondements et applications (Q4809665) (← links)
- A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications (Q4918246) (← links)