Pages that link to "Item:Q3143573"
From MaRDI portal
The following pages link to Generating Approximate Solutions to the TTP using a Linear Distance Relaxation (Q3143573):
Displaying 3 items.
- A multi-round generalization of the traveling tournament problem and its application to Japanese baseball (Q421692) (← links)
- A new branch-and-price algorithm for the traveling tournament problem (Q2655609) (← links)
- A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem (Q2684046) (← links)