Pages that link to "Item:Q475212"
From MaRDI portal
The following pages link to A 5.875-approximation for the traveling tournament problem (Q475212):
Displaying 14 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)
- 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)
- 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 cloud based job sequencing with sequence-dependent setup for sheet metal manufacturing (Q1730499) (← links)
- An approximation algorithm for the traveling tournament problem (Q1761909) (← links)
- Approximation algorithms for \(\mathrm{TTP(2)}\) (Q1935936) (← links)
- A further improvement on approximating TTP-2 (Q2695281) (← links)
- Generating Approximate Solutions to the TTP using a Linear Distance Relaxation (Q3143573) (← links)
- An Improved Approximation Algorithm for the Traveling Tournament Problem (Q3652254) (← links)
- Algorithmic Applications in Management (Q5710104) (← links)