Semidefinite programming based approaches to the break minimization problem

This publication has 10 references indexed in Scilit:

• A polynomial-time algorithm to find an equitable home–away assignment
  Operations Research Letters, 2005
• Minimizing breaks by maximizing cuts
  Operations Research Letters, 2003
• Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
  Optimization Methods and Software, 2003
• NEW APPROXIMATION ALGORITHMS FOR MAX 2SAT AND MAX DICUT
  Journal of the Operations Research Society of Japan, 2003
• Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
  2002
• Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems
  Lecture Notes in Computer Science, 2002
• A Schedule-Then-Break Approach to Sports Timetabling
  Lecture Notes in Computer Science, 2001
• Minimization of the number of breaks in sports scheduling problems using constraint programming
  2001
• Scheduling A Major College Basketball Conference
  Operations Research, 1998
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
  Journal of the ACM, 1995