Pages that link to "Item:Q475199"
From MaRDI portal
The following pages link to A 2.75-approximation algorithm for the unconstrained traveling tournament problem (Q475199):
Displaying 9 items.
- Complexity of the traveling tournament problem (Q620946) (← links)
- An improved approximation algorithm for the traveling tournament problem (Q652542) (← 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)
- A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem (Q2684046) (← links)
- A further improvement on approximating TTP-2 (Q2695281) (← links)
- An Improved Approximation Algorithm for the Traveling Tournament Problem (Q3652254) (← links)
- Unconstrained traveling tournament problem is APX-complete (Q6047703) (← links)