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 9 items.
- Decomposition and local search based methods for the traveling umpire problem (Q296910) (← links)
- 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)
- On the complexity of the traveling umpire problem (Q476848) (← 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)
- Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic (Q2356272) (← links)
- A new branch-and-price algorithm for the traveling tournament problem (Q2655609) (← links)