A branch-and-cut algorithm for scheduling the highly-constrained Chilean soccer tournament

Authors:
Thiago F. Noronha;Celso C. Ribeiro;Guillermo Duran;Sebastian Souyris;Andres Weintraub
Affiliations:
Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, RJ, Brazil;Department of Computer Science, Universidade Federal Fluminense, Niterói, RJ, Brazil;Department of Industrial Engineering, University of Chile, Santiago, Chile;Department of Industrial Engineering, University of Chile, Santiago, Chile;Department of Industrial Engineering, University of Chile, Santiago, Chile
Venue:
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Year:
2006

Citing 6
Cited 3

Introduction to Linear Optimization

Introduction to Linear Optimization
Scheduling a Major College Basketball Conference

Operations Research
Scheduling a Major College Basketball Conference--Revisited

Operations Research
Scheduling the professional soccer leagues of Austria and Germany

Computers and Operations Research
Scheduling the Italian football league: an ILP-based approach

Computers and Operations Research
Scheduling the brazilian soccer tournament with fairness and broadcast objectives

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI

Fair referee assignments for professional football leagues

Computers and Operations Research
The traveling tournament problem with predefined venues

Journal of Scheduling
Scheduling the brazilian soccer tournament with fairness and broadcast objectives

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI

Quantified Score

Hi-index	0.00

Visualization

Abstract

The qualifying phase of the Chilean soccer championship follows the structure of a compact single round robin tournament. Good schedules are of major importance for the success of the tournament, making them more balanced, profitable, and attractive. The schedules were prepared by ad hoc procedures until 2004, when a rough integer programming strategy was proposed. In this work, we improve the original integer programming formulation. We derive valid inequalities for improving the linear relaxation bound and we propose a new branch-and- cut strategy for the problem. Computational results on a real-life instance illustrate the effectiveness of the approach and the improvement in solution quality.