Minimizing breaks by maximizing cuts.

DOI10.1016/S0167-6377(03)00025-7zbMath1033.90039WikidataQ58002911 ScholiaQ58002911MaRDI QIDQ1400343

Michael Jünger, Giovanni Rinaldi, Matthias Elf

Publication date: 13 August 2003

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

Break minimization; Maximum cut; Sports scheduling

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B35: Deterministic scheduling theory in operations research

Related Items

Unnamed Item, Breaks, cuts, and patterns, A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem, On the application of graph colouring techniques in round-robin sports scheduling, The timetable constrained distance minimization problem, A Benders approach for the constrained minimum break problem, Combinatorial properties of strength groups in round robin tournaments, On the separation in 2-period double round robin tournaments with minimum breaks, A polynomial-time algorithm to find an equitable home--away assignment, Round robin scheduling -- a survey, Maximizing breaks and bounding solutions to the mirrored traveling tournament problem, Sports tournaments, home-away assignments, and the break minimization problem, Scheduling the professional soccer leagues of Austria and Germany, Scheduling the Italian football league: an ILP-based approach, Semidefinite programming based approaches to the break minimization problem, ON THE GENERALIZED MIRRORED SCHEME FOR DOUBLE ROUND ROBIN TOURNAMENTS IN SPORTS SCHEDULING

Uses Software

• ABACUS

Cites Work

• Unnamed Item
• Unnamed Item
• The max-cut problem on graphs not contractible to \(K_ 5\)
• Combinatorial aspects of construction of competition Dutch professional football leagues
• Exact ground states of two-dimensional \(\pm J\) Ising spin glasses
• An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
• On the cut polytope