Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
DOI10.1007/978-3-540-72397-4_24zbMATH Open1214.90106OpenAlexW1781674775MaRDI QIDQ3612428FDOQ3612428
Authors: Michael A. Trick, Hakan Yildiz 
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
Recommendations
- Benders' cuts guided large neighborhood search for the traveling umpire problem
- Decomposition and local search based methods for the traveling umpire problem
- A Benders approach for the constrained minimum break problem
- A Benders approach for computing lower bounds for the mirrored traveling tournament problem
- Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cited In (11)
- Constraint programming and operations research
- 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
- 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
- Benders' cuts guided large neighborhood search for the traveling umpire problem
This page was built for publication: Bender’s 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 Q3612428)
