Finding breakfree timetables for incomplete round robin tournaments
- 11 September 2026
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 70
Abstract
No abstract availableFunding Information
- Universiteit Gent
- Bijzonder Onderzoeksfonds UGent (BOF/24J/2021/188)
This publication has 24 references indexed in Scilit:
- Break minimization in incomplete round-robin tournamentsDiscrete Applied Mathematics, 2026
- Beyond leagues: A single incomplete round robin tournament for multi-league sports timetablingEuropean Journal of Operational Research, 2024
- Multi-league sports scheduling with different leagues sizesEuropean Journal of Operational Research, 2022
- Scheduling a non-professional indoor football league: a tabu search based approachAnnals of Operations Research, 2018
- The sport teams grouping problemAnnals of Operations Research, 2017
- Scheduling non-professional table-tennis leaguesEuropean Journal of Operational Research, 2010
- Semidefinite programming based approaches to the break minimization problemComputers & Operations Research, 2006
- Sports tournaments, home–away assignments, and the break minimization problemDiscrete Optimization, 2006
- A polynomial-time algorithm to find an equitable home–away assignmentOperations Research Letters, 2005
- Hard Tiling Problems with Simple TilesDiscrete & Computational Geometry, 2001