Sports tournaments, home-away assignments, and the break minimization problem

G.F. Post, G.J. Woeginger

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

13 Citaten (Scopus)


We consider the break minimization problem for fixing home–away assignments in round-robin sports tournaments. First, we show that, for an opponent schedule with n teams and n-1 rounds, there always exists a home–away assignment with at most breaks. Secondly, for infinitely many n, we construct opponent schedules for which at least breaks are necessary. Finally, we prove that break minimization for n teams and a partial opponent schedule with r rounds is an NP-hard problem for r=3. This is in strong contrast to the case of r=2 rounds, which can be scheduled (in polynomial time) without any breaks.
Originele taal-2Engels
Pagina's (van-tot)165-173
TijdschriftDiscrete Optimization
Nummer van het tijdschrift2
StatusGepubliceerd - 2006


Duik in de onderzoeksthema's van 'Sports tournaments, home-away assignments, and the break minimization problem'. Samen vormen ze een unieke vingerafdruk.

Citeer dit