Advertisement

Balanced Partition of a Graph for Football Team Realignment in Ecuador

  • Diego RecaldeEmail author
  • Daniel Severín
  • Ramiro Torres
  • Polo Vaca
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9849)

Abstract

In the second category of the Ecuadorian football league, a set of football teams must be grouped into \(k\) geographical zones according to some regulations, where the total distance of the road trips that all teams must travel to play a Double Round Robin Tournament in each zone is minimized. This problem can be modeled as a \(k\)-clique partitioning problem with constraints on the sizes and weights of the cliques. An integer programming formulation and a heuristic approach were developed to provide a solution to the problem which has been implemented in the 2015 edition of the aforementioned football championship.

Keywords

Integer programming models Graph partitioning Heuristics Football 

Notes

Acknowledgments

We thank Patricio Torres, authority of the team Liga Deportiva Universitaria, and Galo Barreto, former manager of AFNA, for their support to this project. This research was partially supported by the PACK-COVER MATH-AmSud cooperation project.

References

  1. 1.
    Grötschel, M., Wakabayashi, Y.: A cutting plane algorithm for a clustering problem. Math. Program. 45, 59–96 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Jaehn, F., Pesch, E.: New bounds and constraint propagation techniques for the clique partitioning problem. Discrete Appl. Math. 161, 2025–2037 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Ferreira, C., Martin, A., de Souza, C., Weismantel, R., Wolsey, L.: The node capacitated graph partitioning problem: a computational study. Math. Program. 81, 229–256 (1998)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Furmanczyk, H., Kubale, M.: Equitable coloring of graphs. In: Graph Colorings, Providence, Rhode Island, pp. 35–53. American Mathematical Society (2004)Google Scholar
  5. 5.
    Labbé, M., Özsoy, F.A.: Size-constrained graph partitioning polytopes. Discrete Math. 310, 3473–3493 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    McDonald, B., Pulleyblank, W.: Realignment in the NHL, MLB, NFL, and NBA. J. Quant. Anal. Sports 10, 225–240 (2014)Google Scholar
  7. 7.
    Mitchell, J.: Branch-and-cut for the k-way equipartition problem. Technical report, Department of Mathematical Sciences, Rensselaer Polytechnic Institute (2001)Google Scholar
  8. 8.
    Ji, X., Mitchell, J.E.: Finding optimal realignments in sports leagues using a branch-and-cut-and-price approach. Int. J. Oper. Res. 1, 101–122 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Ji, X., Mitchell, J.E.: Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement. Discrete Optim. 4, 87–102 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Recalde, D., Torres, R., Vaca, P.: Scheduling the professional ecuadorian football league by integer programming. Comput. Oper. Res. 40, 2478–2484 (2013)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Saltzman, R., Bradford, R.M.: Optimal realignments of the teams in the National Football League. Eur. J. Oper. Res. 93, 469–475 (1996)CrossRefzbMATHGoogle Scholar
  12. 12.
    Test instances for the football team realignment in Ecuador. http://www.math.epn.edu.ec/~recalde/#TestInstances/

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Diego Recalde
    • 1
    • 2
    Email author
  • Daniel Severín
    • 3
    • 4
  • Ramiro Torres
    • 1
  • Polo Vaca
    • 1
  1. 1.Departamento de MatemáticaEscuela Politécnica NacionalQuitoEcuador
  2. 2.Research Center on Mathematical Modelling (MODEMAT)Escuela Politécnica NacionalQuitoEcuador
  3. 3.FCEIAUniversidad Nacional de RosarioRosarioArgentina
  4. 4.CONICETRosarioArgentina

Personalised recommendations