Solving mirrored traveling tournament problem benchmark instances with eight teams

DOI10.1016/J.DISOPT.2007.11.003MaRDI QIDQ924643zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Heuristics for the mirrored traveling tournament problem
• Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
• A 5.875-approximation for the traveling tournament problem
• Approximation algorithms for \(\mathrm{TTP(2)}\)
• Approximating the traveling tournament problem with maximum tour length 2

Cites work

• scientific article; zbMATH DE number 3494466 (Why is no real title available?)
• scientific article; zbMATH DE number 2084735 (Why is no real title available?)
• A Benders approach for the constrained minimum break problem
• A simulated annealing and hill-climbing algorithm for the traveling tournament problem
• A simulated annealing approach to the traveling tournament problem
• Heuristics for the mirrored traveling tournament problem
• 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
• Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
• There are 526,915,620 nonisomorphic one‐factorizations of K₁₂

Cited in

(7)

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

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

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