A Benders approach for computing lower bounds for the mirrored traveling tournament problem

DOI10.1016/j.disopt.2008.12.004zbMath1159.90399OpenAlexW1976051387MaRDI QIDQ1015323

Kevin K. H. Cheung

Publication date: 7 May 2009

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2008.12.004

zbMATH Keywords

integer programmingtimetablingsports schedulinglogic-based benders cuts

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20)

Related Items (4)

A new branch-and-price algorithm for the traveling tournament problem ⋮ A traditional Benders' approach to sports timetabling ⋮ A multi-round generalization of the traveling tournament problem and its application to Japanese baseball ⋮ Logic-Based Benders Decomposition for Large-Scale Optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Benders approach for the constrained minimum break problem
• Heuristics for the mirrored traveling tournament problem
• A simulated annealing approach to the traveling tournament problem
• Solving mirrored traveling tournament problem benchmark instances with eight teams
• Logic-based Benders decomposition
• Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
• A simulated annealing and hill-climbing algorithm for the traveling tournament problem
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Locating Minimal Infeasible Constraint Sets in Linear Programs
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

This page was built for publication: A Benders approach for computing lower bounds for the mirrored traveling tournament problem