Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem

DOI10.1007/978-3-540-72397-4_24zbMath1214.90106OpenAlexW1781674775MaRDI QIDQ3612428

Hakan Yildiz, Michael A. Trick

Publication date: 10 March 2009

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72397-4_24

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (11)

Constraint programming and operations research ⋮ Benders' cuts guided large neighborhood search for the traveling umpire problem ⋮ 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 ⋮ On the complexity of the traveling umpire problem ⋮ The sport teams grouping problem ⋮ Logic-Based Benders Decomposition for Large-Scale Optimization ⋮ Referee assignment in the Chilean football league using integer programming and patterns ⋮ Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic

This page was built for publication: Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem