Determining the results of tournament games using complete graphs generation

DOI10.1007/s40314-018-0688-1zbMath1413.05136OpenAlexW2888618676MaRDI QIDQ1715680

Hüseyin Pehlivan, Mouslem Damkhi

Publication date: 29 January 2019

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-018-0688-1

zbMATH Keywords

enumerationtournamentscomplete graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• A combined local search and integer programming approach to the traveling tournament problem
• Edge coloring: a natural model for sports scheduling
• Tournament scoring problem
• Score calculation from final tournament tables
• An algorithm to generate tournament score sequences
• Scheduling double round-robin tournaments with divisional play using constraint programming
• Scheduling asynchronous round-robin tournaments
• The computational complexity of the elimination problem in generalized sports competitions
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
• A simulated annealing and hill-climbing algorithm for the traveling tournament problem
• Scheduling the Italian football league: an ILP-based approach
• Referee assignment in the Chilean football league using integer programming and patterns
• Simultaneous scheduling of football games and referees using Turkish league data
• A tournament problem

This page was built for publication: Determining the results of tournament games using complete graphs generation