A Lagrangian approach for minimum cost single round robin tournaments

Authors:
Dirk Briskorn;Andrei Horbach
Affiliations:
Universität Siegen, Fakultät III, Professur für BWL, insbesondere Quantitative Planung, Hölderlinstr. 3, 57068 Siegen, Germany;Dresden University of Technology, "Friedrich List" Faculty of Transportation and Traffic Sciences, Helmholtzstr. 10, 01069 Dresden, Germany
Venue:
Computers and Operations Research
Year:
2012

Citing 13
Cited 0

Some models of graphs for scheduling sports competitions

Discrete Applied Mathematics
Combinatorial aspects of construction of competition Dutch Professional Football Leagues

Discrete Applied Mathematics - Special issue: Timetabling and chromatic scheduling
Lagrangian relaxation

Modern heuristic techniques for combinatorial problems
Scheduling a Major College Basketball Conference

Operations Research
Scheduling a Major College Basketball Conference--Revisited

Operations Research
Scheduling the professional soccer leagues of Austria and Germany

Computers and Operations Research
Complex Scheduling (GOR-Publications)

Complex Scheduling (GOR-Publications)
The Lagrangian Relaxation Method for Solving Integer Programming Problems

Management Science
An algorithm for finding factorizations of complete graphs

Journal of Graph Theory
IP models for round robin tournaments

Computers and Operations Research
Minimizing costs in round robin tournaments with place constraints

Computers and Operations Research
A method for combining complementary techniques for document image segmentation

Pattern Recognition
Construction of sports schedules with multiple venues

Discrete Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

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 to each match and period. Since matches are carried out at one of the both opponents venues matches may be forbidden in certain periods due to unavailability of stadiums. The goal is to find a minimum cost tournament among those having no match scheduled infeasible. We employ a Lagrangian relaxation approach in order to obtain tight lower bounds. Moreover, we develop a cost-oriented repair mechanism yielding a feasible tournament schedule to each solution of the relaxed problem.