Pages that link to "Item:Q476848"
From MaRDI portal
The following pages link to On the complexity of the traveling umpire problem (Q476848):
Displaying 3 items.
- Two exact algorithms for the traveling umpire problem (Q319246) (← links)
- Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm (Q342392) (← links)
- Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America (Q828758) (← links)
