Balanced partition of a graph for football team realignment in Ecuador

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.

Año de publicación:

2016

Keywords:

• Graph partitioning
• Integer programming models
• heuristics
• football

Fuente:

scopus