On the separation in 2-period double round robin tournaments with minimum breaks

DOI10.1016/j.cor.2011.10.004zbMath1251.90207OpenAlexW2067267106MaRDI QIDQ1762158

Shinji Mizuno, Lishun Zeng

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.10.004

zbMATH Keywords

separationconstraint programmingsports schedulingbreaksround robin tournament

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90)

Related Items

RobinX: a three-field classification and unified data format for round-robin sports timetabling ⋮ ON THE GENERALIZED MIRRORED SCHEME FOR DOUBLE ROUND ROBIN TOURNAMENTS IN SPORTS SCHEDULING

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling in sports: an annotated bibliography
• A Benders approach for the constrained minimum break problem
• Heuristics for the mirrored traveling tournament problem
• A simulated annealing approach to the traveling tournament problem
• Feasibility of home-away-pattern sets for round robin tournaments
• A branching scheme for finding cost-minimal round robin tournaments
• Minimizing costs in round robin tournaments with place constraints
• Minimizing breaks by maximizing cuts.
• Global constraints for round robin tournament scheduling.
• A polynomial-time algorithm to find an equitable home--away assignment
• The traveling tournament problem with predefined venues
• Round robin scheduling -- a survey
• A simulated annealing and hill-climbing algorithm for the traveling tournament problem
• Scheduling the professional soccer leagues of Austria and Germany
• Semidefinite programming based approaches to the break minimization problem
• Scheduling a Major College Basketball Conference—Revisited
• Scheduling in Sports