Abstract
For a given schedule of a round-robin tournament and a matrix of distances between homes of teams, an optimal home-away assignment problem is to find a home-away assignment that minimizes the total traveling distance. We propose a technique to transform the problem to MIN RES CUT . We apply Goemans and Williamson’s 0.878-approximation algorithm for MAX RES CUT, which is based on a positive semidefinite programming relaxation,to the obtained MIN RES CUT instances. Computational experiments show that our approach quickly generates solutions of good approximation ratios.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Easton, K., Nemhauser, G., Trick, M.: Solving the travelling tournament problem: a combined integer programming and constraint programming approach. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 100–109. Springer, Heidelberg (2003)
Easton, K., Nemhauser, G., Trick, M.: Sports Scheduling. In: Leung, J.Y.-T., Anderson, J.H. (eds.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis. Chapman & Hall, Boca Raton (2004)
Elf, M., Jünger, M., Rinaldi, G.: Minimizing breaks by maximizing cuts. Operations Research Letters 31, 343–349 (2003)
Garey, M.R., Johnson, D.S.: Computers and Intractability; a Guide to the Theory of NP-completeness. W. H. Freeman, New York (1979)
Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM 42, 1115–1145 (1995)
ILOG. ILOG CPLEX 8.0 User’s Manual. ILOG (2002)
Miyashiro, R., Matsui, T.: Semidefinite programming based approaches to the break minimization problem. Computers and Operations Research (to appear)
Miyashiro, R., Matsui, T.: A polynomial-time algorithm to find an equitable home–away assignment. Operations Research Letters 33, 235–241 (2005)
Nemhauser, G.L., Trick, M.A.: Scheduling a major college basketball conference. Operations Research 46, 1–8 (1998)
Régin, J.-C.: Minimization of the number of breaks in sports scheduling problems using constraint programming. In: Constraint Programming and Large Scale Discrete Optimization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 57, pp. 115–130 (2001)
Russel, R.A., Leung, J.M.Y.: Devising a cost effective schedule for a baseball league. Operations Research 42, 614–625 (1994)
Trick, M.A.: A schedule-then-break approach to sports timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 242–253. Springer, Heidelberg (2001)
Yamashita, M., Fujisawa, K., Kojima, M.: Implementation and evaluation of SDPA 6.0. Optimization Methods and Software 18, 491–505 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Suzuka, A., Miyashiro, R., Yoshise, A., Matsui, T. (2005). Semidefinite Programming Based Approaches to Home-Away Assignment Problems in Sports Scheduling. In: Megiddo, N., Xu, Y., Zhu, B. (eds) Algorithmic Applications in Management. AAIM 2005. Lecture Notes in Computer Science, vol 3521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496199_12
Download citation
DOI: https://doi.org/10.1007/11496199_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26224-4
Online ISBN: 978-3-540-32440-9
eBook Packages: Computer ScienceComputer Science (R0)