Pages that link to "Item:Q880541"

The following pages link to A simulated annealing approach to the traveling tournament problem (Q880541):

Displaying 35 items.

• A combined local search and integer programming approach to the traveling tournament problem (Q284438) (← links)
• Edge coloring: a natural model for sports scheduling (Q323273) (← links)
• Sports scheduling search space connectivity: a riffle shuffle driven approach (Q335339) (← links)
• A multi-round generalization of the traveling tournament problem and its application to Japanese baseball (Q421692) (← links)
• A 5.875-approximation for the traveling tournament problem (Q475212) (← links)
• A novel non-linear approach to minimal area rectangular packing (Q610981) (← links)
• Complexity of the traveling tournament problem (Q620946) (← links)
• Round robin tournaments and three index assignments (Q633482) (← 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)
• Heuristics for the mirrored traveling tournament problem (Q863992) (← links)
• Optimization in dubbing scheduling (Q889105) (← links)
• Solving mirrored traveling tournament problem benchmark instances with eight teams (Q924643) (← links)
• A Benders approach for computing lower bounds for the mirrored traveling tournament problem (Q1015323) (← links)
• A new neighborhood structure for round robin scheduling problems (Q1651632) (← links)
• The sport teams grouping problem (Q1730756) (← 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)
• 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)
• 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 variable neighborhood search method for solving the traveling tournaments problem (Q2631249) (← links)
• A further improvement on approximating TTP-2 (Q2695281) (← links)
• Sports scheduling: Problems and applications (Q4918255) (← links)
• Confection de calendriers de matchs pour le sport universitaire et collégial au Québec (Q6102699) (← links)