Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm
From MaRDI portal
Publication:342392
DOI10.1016/j.cor.2016.02.014zbMath1349.90385MaRDI QIDQ342392
Lucas de Oliveira, Tallys Yunes, Cid Carvalho De Souza
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.02.014
90C10: Integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B35: Deterministic scheduling theory in operations research
Related Items
Uses Software
Cites Work
- Decomposition and local search based methods for the traveling umpire problem
- Two exact algorithms for the traveling umpire problem
- Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem
- On the complexity of the traveling umpire problem
- Scheduling in sports: an annotated bibliography
- Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic
- Round robin scheduling -- a survey
- Fair referee assignments for professional football leagues
- Benders' cuts guided large neighborhood search for the traveling umpire problem
- Path inequalities for the vehicle routing problem with time windows