Solving mirrored traveling tournament problem benchmark instances with eight teams

DOI10.1016/J.DISOPT.2007.11.003zbMath1134.90011OpenAlexW2008488464MaRDI QIDQ924643

Kevin K. H. Cheung

Publication date: 16 May 2008

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

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

zbMATH Keywords

integer programmingsports schedulingone-factorizationtraveling tournament

Mathematics Subject Classification ID

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

Related Items (6)

Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America ⋮ A new branch-and-price algorithm for the traveling tournament problem ⋮ First-break-heuristically-schedule: constructing highly-constrained sports timetables ⋮ A multi-round generalization of the traveling tournament problem and its application to Japanese baseball ⋮ Sports scheduling: Problems and applications ⋮ A Benders approach for computing lower bounds for the mirrored traveling tournament problem

Cites Work

• 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
• Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
• A simulated annealing and hill-climbing algorithm for the traveling tournament problem
• There are 526,915,620 nonisomorphic one‐factorizations of K₁₂
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

This page was built for publication: Solving mirrored traveling tournament problem benchmark instances with eight teams