Finding optimal realignments in sports leagues using a branch-and-cut-and-price approach

Xiaoyun Ji and John E. Mitchell

International Journal of Operational Research, 2005, vol. 1, issue 1/2, 101-122

Abstract: The sports team realignment problem can be modelled as k-way equipartition: given a complete graph K_n = (V, E), with edge weight c_e on each edge, partition the vertices V into k divisions that have exactly S vertices, so as to minimise 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 scheme. We demonstrated the necessity of cutting planes for this problem and suggested an effective way of adding cutting planes in the branch-and-price framework. We solved the pricing subproblem as an integer programming problem. Using this method, we found the optimal realignment solution for three major professional sports leagues in North America (basketball, hockey, football). We also present computational results on some larger randomly generated microaggregation problems.

Keywords: graph equipartition; branch-and-price; clustering; microaggregation; sports team realignment; NBA; National Basketball Association; National Hockey League; NHL; National Football League; NFL; sports leagues. (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=7436 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:1:y:2005:i:1/2:p:101-122

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().