Decomposition and local search based methods for the traveling umpire problem

DOI10.1016/J.EJOR.2014.04.043MaRDI QIDQ296910zbMATH OpenOpenAlexFDO

Authors T. Wauters, Sam Van Malderen, Greet Vanden Berghe

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

heuristicsdecompositionOR in sportsiterated local searchtraveling umpire problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Combinatorial optimization (90C27)

Recommendations

• Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem
• Two exact algorithms for the traveling umpire problem
• On the complexity of the traveling umpire problem
• Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic
• A combined local search and integer programming approach to the traveling tournament problem
• Benders' cuts guided large neighborhood search for the traveling umpire problem
• Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
• Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm
• scientific article; zbMATH DE number 177832

Cites work

• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• scientific article; zbMATH DE number 2084735 (Why is no real title available?)
• Assigning judges to competitions of several rounds using tabu search
• Benders' cuts guided large neighborhood search for the traveling umpire problem
• Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
• Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic
• Metaheuristics. From design to implementation.
• Referee assignment in the Chilean football league using integer programming and patterns
• Scheduling in sports: an annotated bibliography

Cited in

(8)

• Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
• An optimization approach to designing a baseball scout network
• 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
• 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

This page was built for publication: Decomposition and local search based methods for the traveling umpire problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296910)