Preface	6
	Contents	7
	1 Introduction	10
	1.1 Motivation	10
	1.2 Related Work	11
	1.3 Basic Notation	12
	1.4 Outline	13
	2 Basic Problems	14
	2.1 Single Round Robin Tournament	15
	2.2 Double Round Robin Tournament	21
	2.3 r Round Robin Tournament	25
	2.4 Decomposition Schemes	27
	3 Real World Problems	37
	3.1 Externally Given Constraints	38
	3.2 Fairness Constraints	41
	3.3 Computational Study	50
	3.4 Summary	65
	4 Combinatorial Properties of Strength Groups	66
	4.1 Factorizations	67
	4.2 Group–Balanced Single Round Robin Tournaments	74
	4.3 Group–Changing Single Round Robin Tournaments	77
	4.4 Complexity	82
	4.5 Summary	84
	5 Home-Away-Pattern Based Branching Schemes	86
	5.1 Motivation	86
	5.2 General Home-Away-Pattern Sets	87
	5.3 Minimum Number of Breaks	93
	5.4 Computational Results	105
	5.5 Summary	108
	6 Branch–and–Price Algorithm	110
	6.1 Motivation and Basic Idea	110
	6.2 Reformulation	111
	6.3 Branching Scheme	118
	6.4 Column Generation	126
	6.5 Upper Bounds	140
	6.6 Computational Results	144
	6.7 Summary	149
	7 Conclusions and Outlook	151
	References	153
	Index	160
	List of Definitions	162
	List of Models	163
	List of Figures	164
	List of Tables	165