Pages that link to "Item:Q620946"
From MaRDI portal
The following pages link to Complexity of the traveling tournament problem (Q620946):
Displaying 16 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)
- 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)
- Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America (Q828758) (← links)
- Scheduling Argentina's professional basketball leagues: a variation on the travelling tournament problem (Q1719646) (← links)
- Complexity of the unconstrained traveling tournament problem (Q1755839) (← links)
- Approximation algorithms for \(\mathrm{TTP(2)}\) (Q1935936) (← links)
- A beam search approach to the traveling tournament problem (Q2057120) (← links)
- A variable neighborhood search method for solving the traveling tournaments problem (Q2631249) (← 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)
- Sports scheduling: Problems and applications (Q4918255) (← links)
- Unconstrained traveling tournament problem is APX-complete (Q6047703) (← links)
- Round-robin scheduling with regard to rest differences (Q6113552) (← links)