Minimizing breaks by maximizing cuts.

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

Michael Jünger, Giovanni Rinaldi, Matthias Elf

Publication date: 13 August 2003

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

Full work available at URL: https://doi.org/10.1016/s0167-6377(03)00025-7

zbMATH Keywords

Break minimizationMaximum cutSports scheduling

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items

The timetable constrained distance minimization problem, A Benders approach for the constrained minimum break problem, An effective iterated tabu search for the maximum bisection problem, Determining matchdays in sports league schedules to minimize rest differences, Breaks, cuts, and patterns, Round-robin scheduling with regard to rest differences, A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem, Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem, Round robin scheduling -- a survey, On the separation in 2-period double round robin tournaments with minimum breaks, On the application of graph colouring techniques in round-robin sports scheduling, A polynomial-time algorithm to find an equitable home--away assignment, Maximizing breaks and bounding solutions to the mirrored traveling tournament problem, Sports tournaments, home-away assignments, and the break minimization problem, Combinatorial properties of strength groups in round robin tournaments, Unnamed Item, ON THE GENERALIZED MIRRORED SCHEME FOR DOUBLE ROUND ROBIN TOURNAMENTS IN SPORTS SCHEDULING, Integrated break and carryover effect minimization, 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

Uses Software

• ABACUS

Cites Work

• 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
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization