Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem

DOI10.1016/j.ejor.2015.10.004zbMath1346.90393OpenAlexW1793246991MaRDI QIDQ322545

Sam Van Malderen, Tony Wauters, Túlio A. M. Toffolo, Greet vanden Berghe

Publication date: 7 October 2016

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

Full work available at URL: http://www.repositorio.ufop.br/handle/123456789/7013

zbMATH Keywords

branch-and-bounddecomposition strategiestraveling umpire problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America ⋮ Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm ⋮ The sport teams grouping problem ⋮ An optimization approach to designing a baseball scout network

Cites Work

• Decomposition and local search based methods for the traveling umpire problem
• Two exact algorithms for 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
• Algorithms for the Assignment and Transportation Problems
• An Automatic Method of Solving Discrete Programming Problems
• Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem

This page was built for publication: Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem