Pages that link to "Item:Q322545"
From MaRDI portal
The following pages link to Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem (Q322545):
Displaying 4 items.
- 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)
- The sport teams grouping problem (Q1730756) (← links)
- An optimization approach to designing a baseball scout network (Q1752145) (← links)
