A polynomial-time algorithm to find an equitable home-away assignment

Authors:
Ryuhei Miyashiro;Tomomi Matsui
Affiliations:
Graduate School of Information Science and Technology, University of Tokyo, Tokyo 113-8656, Japan;Graduate School of Information Science and Technology, University of Tokyo, Tokyo 113-8656, Japan
Venue:
Operations Research Letters
Year:
2005

Citing 6
Cited 8

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Minimization of the number of breaks in sports scheduling problems using constraint programming

DIMACS workshop on on Constraint programming and large scale discrete optimization
A Schedule-Then-Break Approach to Sports Timetabling

PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
Scheduling a Major College Basketball Conference

Operations Research
Semidefinite programming based approaches to the break minimization problem

Computers and Operations Research
Minimizing breaks by maximizing cuts

Operations Research Letters

Semidefinite programming based approaches to the break minimization problem

Computers and Operations Research
Maximizing breaks and bounding solutions to the mirrored traveling tournament problem

Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Constructive algorithms for the constant distance traveling tournament problem

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
On the application of graph colouring techniques in round-robin sports scheduling

Computers and Operations Research
On the separation in 2-period double round robin tournaments with minimum breaks

Computers and Operations Research
Semidefinite programming based approaches to home-away assignment problems in sports scheduling

AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Balanced home-away assignments

Discrete Optimization
Sports tournaments, home-away assignments, and the break minimization problem

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a polynomial-time algorithm to find an equitable home-away assignment for a given timetable of a round-robin tournament. Our results give an answer to a problem raised by Elf et al. (Oper. Res. Lett. 31 (2003) 343), which concerns the computational complexity of the break minimization problem in sports timetabling.