A note on symmetry reduction for circular traveling tournament problems

DOI10.1016/j.ejor.2010.08.015zbMath1231.90194OpenAlexW2078717298MaRDI QIDQ531484

Timo Gschwind, Stefan Irnich

Publication date: 29 April 2011

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.08.015

zbMATH Keywords

timetablingsymmetry reductiontraveling tournament problemcircular instancessports league scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems ⋮ Competitive strategies for an online generalized assignment problem with a service consecution constraint

Cites Work

• Unnamed Item
• Geography, games and graphs
• A new branch-and-price algorithm for the traveling tournament problem
• DFS* and the Traveling Tournament Problem
• The classification of the finite simple groups

This page was built for publication: A note on symmetry reduction for circular traveling tournament problems