Pages that link to "Item:Q2356272"
From MaRDI portal
The following pages link to Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic (Q2356272):
Displayed 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)
- On the complexity of the traveling umpire problem (Q476848) (← links)
- An optimization approach to designing a baseball scout network (Q1752145) (← links)
- Relax-fix-optimize heuristics for time-relaxed sports timetabling (Q5889201) (← links)
- A kernel search heuristic for the multivehicle inventory routing problem (Q6092539) (← links)