Pages that link to "Item:Q319246"
From MaRDI portal
The following pages link to Two exact algorithms for the traveling umpire problem (Q319246):
Displaying 7 items.
- Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem (Q322545) (← 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)
- The sport teams grouping problem (Q1730756) (← links)
- An optimization approach to designing a baseball scout network (Q1752145) (← links)
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
- An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs (Q5106386) (← links)