Decomposition and local search based methods for the traveling umpire problem

DOI10.1016/j.ejor.2014.04.043zbMath1338.90186MaRDI QIDQ296910

Sam Van Malderen, Greet vanden Berghe, Tony Wauters

Publication date: 23 June 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/451874

zbMATH Keywords

heuristics; decomposition; iterated local search; OR in sports; traveling umpire problem

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C27: Combinatorial optimization

90B90: Case-oriented studies in operations research

Related Items

Two exact algorithms for the traveling umpire problem, Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem, Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm, On the complexity of the traveling umpire problem, An optimization approach to designing a baseball scout network

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Assigning judges to competitions of several rounds using tabu search
• Scheduling in sports: an annotated bibliography
• Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic
• Benders' cuts guided large neighborhood search for the traveling umpire problem
• Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
• Referee assignment in the Chilean football league using integer programming and patterns