Pages that link to "Item:Q652542"
From MaRDI portal
The following pages link to An improved approximation algorithm for the traveling tournament problem (Q652542):
Displaying 13 items.
- 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)
- A Benders approach for computing lower bounds for the mirrored traveling tournament problem (Q1015323) (← links)
- Complexity of the unconstrained traveling tournament problem (Q1755839) (← links)
- An approximation algorithm for the traveling tournament problem (Q1761909) (← links)
- Approximation algorithms for \(\mathrm{TTP(2)}\) (Q1935936) (← links)
- A beam search approach to the traveling tournament problem (Q2057120) (← links)
- A further improvement on approximating TTP-2 (Q2695281) (← links)
- An Improved Approximation Algorithm for the Traveling Tournament Problem (Q3652254) (← links)
- (Q4861868) (← links)
- Improving TSP Tours Using Dynamic Programming over Tree Decompositions (Q4973050) (← links)