Benders' cuts guided large neighborhood search for the traveling umpire problem

DOI10.1002/NAV.20482zbMATH Open1241.90059OpenAlexW2032610799MaRDI QIDQ2892136FDOQ2892136

Authors: Michael A. Trick, Hakan Yildiz 

Publication date: 18 June 2012

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20482

Recommendations

• Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
• A Benders approach for computing lower bounds for the mirrored traveling tournament problem
• A Benders approach for the constrained minimum break problem
• Decomposition and local search based methods for the traveling umpire problem
• Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm

zbMATH Keywords

large neighborhood searchpersonnel schedulingspotsBenders cuts

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Logic-based Benders decomposition
• Planning and Scheduling by Logic-Based Benders Decomposition
• Title not available (Why is that?)
• Scheduling in sports: an annotated bibliography
• Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• 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
• A Benders approach for the constrained minimum break problem
• Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming

Cited In (11)

• Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
• The sport teams grouping problem
• 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
• Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm
• On the complexity of the traveling umpire problem
• Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals
• Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic
• Logic-based Benders decomposition for large-scale optimization

This page was built for publication: Benders' cuts guided large neighborhood search for the traveling umpire problem

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