A branching scheme for minimum cost tournaments with regard to real-world constraints

D Briskorn
Additional contact information
D Briskorn: Universit&aauml;t zu Köln, Köln, Germany

Journal of the Operational Research Society, 2011, vol. 62, issue 12, 2133-2145

Abstract: Single round robin tournaments are a well-known class of sports leagues schedules. We consider leagues with a set T of n teams where n is even. Costs are associated with each possible match. Moreover, stadium availability, fixed matches, and regions’ capacities are taken into account. The goal is to find the minimum cost tournament among those having the minimum number of breaks and being feasible with regard to these additional constraints. A branching scheme is developed where branching is done by fixing a break for a team. Thus, the focus is on identifying breaks leading to an infeasible home away pattern set in order to avoid the resulting infeasible subtrees of a branch and bound tree.

Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.palgrave-journals.com/jors/journal/v62/n12/pdf/jors2010185a.pdf Link to full text PDF (application/pdf)
http://www.palgrave-journals.com/jors/journal/v62/n12/full/jors2010185a.html Link to full text HTML (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:pal:jorsoc:v:62:y:2011:i:12:p:2133-2145

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().