The sports team realignment problem can be modelled as k-way equipartition: given a complete graph Kn = (V, E), with edge weight ce on each edge, partition the vertices V into k divisions that have exactly S vertices, so as to minimize the total weight of the edges that have both endpoints in the same division. In this paper, we discuss solving k-way equipartition problem using branch-and-price...