Branching Based on Home-Away-Pattern Sets

Dirk Briskorn () and Andreas Drexl ()
Additional contact information
Dirk Briskorn: Christian-Albrechts-Universität zu Kiel
Andreas Drexl: Christian-Albrechts-Universität zu Kiel

A chapter in Operations Research Proceedings 2006, 2007, pp 523-528 from Springer

Abstract: Abstract Scheduling a sports league requires to solve a hard combinatorial optimization problem. We consider a league of a set T of n teams supposed to play in a single round robin tournament (SRRT). Accordingly, each team i ∈ T has to play against each other team j ∈ T, j ≠ i, exactly one match. The tournament is partitioned into matchdays (MD) being periods where matches can be carried out. Each team i ∈ T shall play exactly once per MD. Hence, we have a compact structure resulting in an ordered set P of n −1 MDs.

Keywords: Sport League; Automate Timetabling; Soccer League; Lower Memory Requirement; Proven Optimality (search for similar items in EconPapers)
Date: 2007
References: Add references at CitEc
Citations: View citations in EconPapers (3)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-540-69995-8_83

Ordering information: This item can be ordered from
http://www.springer.com/9783540699958

DOI: 10.1007/978-3-540-69995-8_83

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().