Pages that link to "Item:Q476848"
From MaRDI portal
The following pages link to On the complexity of the traveling umpire problem (Q476848):
Displaying 8 items.
- Decomposition and local search based methods for the traveling umpire problem (Q296910) (← links)
- Two exact algorithms for the traveling umpire problem (Q319246) (← links)
- 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)
- Complexity of the traveling tournament problem (Q620946) (← links)
- Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America (Q828758) (← links)
- Complexity of the unconstrained traveling tournament problem (Q1755839) (← links)
- Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic (Q2356272) (← links)