Minimizing breaks by maximizing cuts

Authors:
Matthias Elf;Michael JüNger;Giovanni Rinaldi
Affiliations:
Institut für Informatik, Universität zu Köln, Cologne, Germany;Institut für Informatik, Universität zu Köln, Cologne, Germany;Istituto di Analisi dei Sistemi ed Informatica del CNR, Rome, Italy
Venue:
Operations Research Letters
Year:
2003

Citing 7
Cited 11

On the cut polytope

Mathematical Programming: Series A and B
An application of combinatorial optimization to statistical physics and circuit layout design

Operations Research
Combinatorial aspects of construction of competition Dutch Professional Football Leagues

Discrete Applied Mathematics - Special issue: Timetabling and chromatic scheduling
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization

Software—Practice & Experience - Special issue on discrete algorithm engineering
Minimization of the number of breaks in sports scheduling problems using constraint programming

DIMACS workshop on on Constraint programming and large scale discrete optimization
A Schedule-Then-Break Approach to Sports Timetabling

PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
The max-cut problem on graphs not contractible to K5

Operations Research Letters

Scheduling the professional soccer leagues of Austria and Germany

Computers and Operations Research
Scheduling the Italian football league: an ILP-based approach

Computers and Operations Research
Semidefinite programming based approaches to the break minimization problem

Computers and Operations Research
Maximizing breaks and bounding solutions to the mirrored traveling tournament problem

Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
On the application of graph colouring techniques in round-robin sports scheduling

Computers and Operations Research
On the separation in 2-period double round robin tournaments with minimum breaks

Computers and Operations Research
Semidefinite programming based approaches to home-away assignment problems in sports scheduling

AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
The timetable constrained distance minimization problem

CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Sports tournaments, home-away assignments, and the break minimization problem

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

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.