Skip to main content

A Branch-and-Cut Algorithm for Scheduling the Highly-Constrained Chilean Soccer Tournament

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 3867)

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.

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bartsch, T., Drexl, A., Kroger, S.: Scheduling the professional soccer leagues of Austria and Germany. Computers and Operations Research 33, 1907–1937 (2006)

    CrossRef  MATH  Google Scholar 

  2. Bean, J.C., Birge, J.R.: Reducing traveling costs and player fatigue in the National Basketball Association. Interfaces 10, 98–102 (1980)

    Google Scholar 

  3. Bertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization. Athena Scientific, Nashua, NH (1997)

    Google Scholar 

  4. Costa, D.: An evolutionary tabu search algorithm and the NHL scheduling problem. Information Systems and Operational Research 33, 161–178 (1995)

    MATH  Google Scholar 

  5. Della Croce, F., Oliveri, D.: Scheduling the Italian football league: An ILP-based approach. Computers and Operations Research 33, 1963–1974 (2006)

    CrossRef  MATH  Google Scholar 

  6. Duran, G., Guajardo, M., Miranda, J., Sauré, D., Souyris, S., Weintraub, A., Carmash, A., Chaineu, F.: Programación matemática aplicada al fixture de la primera divisón del fútbol Chileno. Revista Ingeniería de Sistemas 5, 29–46 (2005)

    Google Scholar 

  7. Goossens, D., Spieksma, F.C.R.: Scheduling the Belgian soccer league. In: Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling, Brno, pp. 420–422 (August 2006)

    Google Scholar 

  8. Henz, M.: Scheduling a major college basketball conference revisited. Operations Research 49, 163–168 (2001)

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. Henz, M., Müller, T., Thiel, S.: Global constraints for round robin tournament scheduling. European Journal of Operational Research 153, 92–101 (2004)

    CrossRef  MATH  MathSciNet  Google Scholar 

  10. Nemhauser, G.L., Trick, M.A.: Scheduling a major college basketball conference. Operations Research 46, 1–8 (1998)

    CrossRef  Google Scholar 

  11. Padberg, M.W., Rao, M.R.: Odd minimum cut-sets and b-matchings. Mathematics of Operation Research 7, 67–80 (1982)

    MATH  MathSciNet  Google Scholar 

  12. Ribeiro, C.C., Urrutia, S.: Scheduling the Brazilian soccer tournament with fairness and broadcast objectives. In: Burke, E.K., Rudová, H. (eds.) PATAT 2006. LNCS, vol. 3867, pp. 149–159. Springer, Heidelberg (2007)

    Google Scholar 

  13. Trick, M.A.: A schedule-and-break approach to sports scheduling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 242–253. Springer, Heidelberg (2001)

    CrossRef  Google Scholar 

  14. Trick, M.A.: Integer and constraint programming approaches for round robin tournament scheduling. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 63–77. Springer, Heidelberg (2003)

    Google Scholar 

  15. Zhang, H.: Generating college conference basketball schedules by a SAT solver. In: Proceedings of the 5th International Symposium on the Theory and Applications of Satisfiability Testing, Cincinnati, pp. 281–291 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Edmund K. Burke Hana Rudová

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Noronha, T.F., Ribeiro, C.C., Duran, G., Souyris, S., Weintraub, A. (2007). A Branch-and-Cut Algorithm for Scheduling the Highly-Constrained Chilean Soccer Tournament. In: Burke, E.K., Rudová, H. (eds) Practice and Theory of Automated Timetabling VI. PATAT 2006. Lecture Notes in Computer Science, vol 3867. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77345-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77345-0_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77344-3

  • Online ISBN: 978-3-540-77345-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics