Pages that link to "Item:Q1761909"
From MaRDI portal
The following pages link to An approximation algorithm for the traveling tournament problem (Q1761909):
Displaying 13 items.
- A combined local search and integer programming approach to the traveling tournament problem (Q284438) (← links)
- A 2.75-approximation algorithm for the unconstrained traveling tournament problem (Q475199) (← links)
- A note on symmetry reduction for circular traveling tournament problems (Q531484) (← links)
- Complexity of the traveling tournament problem (Q620946) (← links)
- An improved approximation algorithm for the traveling tournament problem (Q652542) (← links)
- Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America (Q828758) (← links)
- A Benders approach for computing lower bounds for the mirrored traveling tournament problem (Q1015323) (← links)
- A comparison of algorithms for finding an efficient theme park tour (Q1741683) (← links)
- Approximation algorithms for \(\mathrm{TTP(2)}\) (Q1935936) (← links)
- A beam search approach to the traveling tournament problem (Q2057120) (← links)
- Splitting a giant tour using integer linear programming (Q2631278) (← links)
- A further improvement on approximating TTP-2 (Q2695281) (← links)
- An Improved Approximation Algorithm for the Traveling Tournament Problem (Q3652254) (← links)