首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Minimizing breaks by maximizing cuts
Authors:Matthias Elf  Michael JüngerGiovanni Rinaldi
Institution: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 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号