A note on symmetry reduction for circular traveling tournament problems

DOI10.1016/J.EJOR.2010.08.015MaRDI QIDQ531484zbMATH OpenOpenAlexFDO

Authors 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

circular instancessports league schedulingsymmetry reductiontimetablingtraveling tournament problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A comparison of lower bounds for the symmetric circulant traveling salesman problem
• scientific article; zbMATH DE number 1439496
• An approximation algorithm for the traveling tournament problem
• An Improved Approximation Algorithm for the Traveling Tournament Problem
• An improved approximation algorithm for the traveling tournament problem
• Symmetric travelling salesman problem. Some new algorithmic possibilities
• New lower bounds for the symmetric travelling salesman problem
• A note on reducible cycles in multipartite tournaments
• The symmetric travelling salesman problem. II: New low bounds
• scientific article; zbMATH DE number 2084735

Cites work

• A new branch-and-price algorithm for the traveling tournament problem
• DFS* and the Traveling Tournament Problem
• Geography, games and graphs
• scientific article; zbMATH DE number 2084735 (Why is no real title available?)
• The classification of the finite simple groups

Cited in

(4)

• Competitive strategies for an online generalized assignment problem with a service consecution constraint
• A new branch-and-price algorithm for the traveling tournament problem
• DFS* and the Traveling Tournament Problem
• A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems

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

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