Minimizing breaks by maximizing cuts |
| |
Authors: | Matthias Elf,Michael Jü ngerGiovanni Rinaldi |
| |
Affiliation: | a Institut für Informatik, Universität zu Köln, Cologne, Germany b Istituto di Analisi dei Sistemi ed Informatica del CNR, Rome, Italy |
| |
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. |
| |
Keywords: | Sports scheduling Maximum cut Break minimization |
本文献已被 ScienceDirect 等数据库收录! |