Abstract
The Brazilian soccer tournament is organized every year by the Brazilian Soccer Confederation. Its major sponsor is TV Globo, the largest media group and television network in Brazil, which imposes constraints on the games to be broadcast. Scheduling the games of this tournament is a very constrained problem, with two objectives: breaks minimization (fairness) and the maximization of the revenues from TV broadcasting. We propose an integer programming decomposition strategy to solve this problem to optimality. Numerical results obtained for the 2005 and 2006 editions of the tournament are reported and compared. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Ribeiro, C. C., & Urrutia, S. (2006). Scheduling the Brazilian Soccer Tournament with fairness and broadcast objectives. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3867 LNCS, pp. 147–157). Springer Verlag. https://doi.org/10.1007/978-3-540-77345-0_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
