ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Operations Research Letters
Volume 33, Issue 3, May 2005, Pages 235-241
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (176 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (10)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.orl.2004.06.004    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2004 Elsevier B.V. All rights reserved.

A polynomial-time algorithm to find an equitable home–away assignmentstar, open

Ryuhei MiyashiroCorresponding Author Contact Information, E-mail The Corresponding Author and Tomomi MatsuiE-mail The Corresponding Author

Graduate School of Information Science and Technology, University of Tokyo, Tokyo 113-8656, Japan

Received 31 March 2004; 
accepted 24 June 2004. 
Available online 22 September 2004.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

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.

Keywords: Sports timetabling; Scheduling; Tournament; 2-satisfiability problem

Article Outline

1. Introduction
2. Problems
2.1. Definitions
2.2. Break minimization and maximization
3. Algorithms
3.1. A home–away assignment with a minimum number of breaks
3.2. An equitable home–away assignment
4. Discussion
References



Operations Research Letters
Volume 33, Issue 3, May 2005, Pages 235-241
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.