Pages that link to "Item:Q296910"
From MaRDI portal
The following pages link to Decomposition and local search based methods for the traveling umpire problem (Q296910):
Displaying 5 items.
- 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)
- On the complexity of the traveling umpire problem (Q476848) (← links)
- An optimization approach to designing a baseball scout network (Q1752145) (← links)
