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

Operations Research Letters

Volumn 33, Issue 3, 2005, Pages 235-241

  Miyashiro, Ryuhei ^a   Matsui, Tomomi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

2 satisfiability problem; Scheduling; Sports timetabling; Tournament

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING; SET THEORY; THEOREM PROVING;

2-SATISFIABILITY PROBLEM; POLYNOMIAL-TIME ALGORITHMS; SPORTS TIMETABLING; TOURNAMENT;

ALGORITHMS;

EID: 10044266294     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.06.004     Document Type: Article

References (13)

1. B. Aspval, M.F. Plass, R.E. Tarjan, A linear-time algorithm for testing the truth of certain quantified Boolean formulas, Inform. Process. Lett. 8 (1979) 121-123.
2. D. de Werra, Geography, games and graphs, Discrete Appl. Math. 2 (1980) 327-337.
3. D. de Werra, Minimizing irregularities in sports schedules using graph theory, Discrete Appl. Math. 4 (1982) 217-226.
4. K. Easton, G.L. Nemhauser, M.A. Trick, Solving the traveling tournament problem: a combined integer programming and constraint programming approach, in: E. Burke, P. De Causmaecker (Eds.), Practice and Theory of Automated Timetabling IV (Lecture Notes in Computer Science 2740), Springer, Berlin, 2003, pp. 100-109.
5. M. Elf, M. Jünger, G. Rinaldi, Minimizing breaks by maximizing cuts, Oper. Res. Lett. 31 (2003) 343-349.
6. M.X. Goemans, D.P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM 42 (1995) 1115-1145.
7. R. Miyashiro, H. Iwasaki, T. Matsui, Characterizing feasible pattern sets with a minimum number of breaks, in: E. Burke, P. De Causmaecker (Eds.), Practice and Theory of Automated Timetabling IV (Lecture Notes in Computer Science, Vol. 2740), Springer, Berlin, 2003, pp. 78-99.
8. R. Miyashiro, T. Matsui, Semidefinite programming based approaches to the break minimization problem, METR 2003-28, University of Tokyo, August 2003.
9. G.L. Nemhauser, M.A. Trick, Scheduling a major college basketball conference, Oper. Res. 46 (1998) 1-8.
10. J.-C. Régin, Minimization of the number of breaks in sports scheduling problems using constraint programming, in: E.G. Freuder, R.J. Wallace (Eds.), Constraint Programming and Large Scale Discrete Optimization (DIMACS Series in Discrete Mathematics and Theoretical Computer Science 57), American Mathematical Society, Providence, 2001, pp. 115-130.
11. A. Rosa, W.D. Wallis, Premature sets of 1-factors or how not to schedule round-robin tournaments, Discrete Appl. Math. 4 (1982) 291-297.
12. R.A. Russell, J.M.Y. Leung, Devising a cost effective schedule for a baseball league, Oper. Res. 42 (1994) 614-625.
13. M.A. Trick, A schedule-then-break approach to sports timetabling, in: E. Burke, W. Erben (Eds.), Practice and Theory of Automated Timetabling III (Lecture Notes in Computer Science, Vol. 2079), Springer, Berlin, 2001, pp. 242-253.