Minimizing breaks by maximizing cuts

Minimizing breaks by maximizing cuts

0.00 Avg rating0 Votes
Article ID: iaor20041030
Country: Netherlands
Volume: 31
Issue: 5
Start Page Number: 343
End Page Number: 349
Publication Date: Sep 2003
Journal: Operations Research Letters
Authors: , ,
Keywords: sports, programming: integer
Abstract:

We propose to solve the break minimization problem in sports scheduling by transforming it into a maximum cut problem in an undirected graph and applying a branch-and-cut algorithm. Our approach outperforms previous approaches with constraint programming and integer programming techniques.

Reviews

Required fields are marked *. Your email address will not be published.