Finding optimal realignments in sports leagues using a branch-and-cut-and-price approach
by Xiaoyun Ji, John E. Mitchell
International Journal of Operational Research (IJOR), Vol. 1, No. 1/2, 2005

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.

Online publication date: Wed, 20-Jul-2005

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com