Benders' cuts guided large neighborhood search for the traveling umpire problem
From MaRDI portal
Publication:2892136
DOI10.1002/nav.20482zbMath1241.90059MaRDI QIDQ2892136
Michael A. Trick, Hakan Yildiz
Publication date: 18 June 2012
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20482
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Referee assignment in the Chilean football league using integer programming and patterns, 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, Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals, Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm, On the complexity of the traveling umpire problem, The sport teams grouping problem, Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic, Logic-Based Benders Decomposition for Large-Scale Optimization
Cites Work
- Unnamed Item
- Scheduling in sports: an annotated bibliography
- A Benders approach for the constrained minimum break problem
- Logic-based Benders decomposition
- Sports leagues scheduling. Models, combinatorial properties, and optimization algorithms.
- Round robin scheduling -- a survey
- Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Planning and Scheduling by Logic-Based Benders Decomposition
- Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
- Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming
