Pages that link to "Item:Q1935936"
From MaRDI portal
The following pages link to Approximation algorithms for \(\mathrm{TTP(2)}\) (Q1935936):
Displaying 7 items.
- A 5.875-approximation for the traveling tournament problem (Q475212) (← links)
- Solving mirrored traveling tournament problem benchmark instances with eight teams (Q924643) (← links)
- An efficient algorithm for computing the approximate t-URV and its applications (Q2162323) (← links)
- A new branch-and-price algorithm for the traveling tournament problem (Q2655609) (← links)
- A further improvement on approximating TTP-2 (Q2695281) (← links)
- Generating Approximate Solutions to the TTP using a Linear Distance Relaxation (Q3143573) (← links)
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems (Q3912012) (← links)