Minimizing breaks by maximizing cuts.

DOI10.1016/S0167-6377(03)00025-7MaRDI QIDQ1400343zbMATH OpenOpenAlexWikidataFDO

Authors Matthias Elf, Michael Jünger, G. Rinaldi

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, https://kups.ub.uni-koeln.de/54854/1/zaik2001-409.pdf

zbMATH Keywords

Break minimizationMaximum cutSports scheduling

Mathematics Subject Classification ID

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

Recommendations

• Semidefinite programming based approaches to the break minimization problem
• Minimization of the number of breaks in sports scheduling problems using constraint programming
• Sports tournaments, home-away assignments, and the break minimization problem
• The home-away assignment problems and break minimization/maximization problems in sports scheduling
• A Benders approach for the constrained minimum break problem

Cites work

• A schedule-then-break approach to sports timetabling
• An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
• Combinatorial aspects of construction of competition Dutch professional football leagues
• Exact ground states of two-dimensional \(\pm J\) Ising spin glasses
• On the cut polytope
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
• The max-cut problem on graphs not contractible to \(K_ 5\)

Cited in

(25)

• Combinatorial properties of strength groups in round robin tournaments
• An effective iterated tabu search for the maximum bisection problem
• On the separation in 2-period double round robin tournaments with minimum breaks
• A polynomial-time algorithm to find an equitable home--away assignment
• Integrated break and carryover effect minimization
• Determining matchdays in sports league schedules to minimize rest differences
• 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
• Minimization of the number of breaks in sports scheduling problems using constraint programming
• On the generalized mirrored scheme for double round robin tournaments in sports scheduling
• Breaks, cuts, and patterns
• Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
• scientific article; zbMATH DE number 2230230 (Why is no real title available?)
• Round-robin scheduling with regard to rest differences
• A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
• Tournament design: a review from an operational research perspective
• Break maximization for round-robin tournaments without consecutive breaks
• On the application of graph colouring techniques in round-robin sports scheduling
• Fair schedules for single round robin tournaments with ranked participants
• The timetable constrained distance minimization problem
• A Benders approach for the constrained minimum break problem

Describes a project that uses

Uses Software

• ABACUS

This page was built for publication: Minimizing breaks by maximizing cuts.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1400343)