First-break-heuristically-schedule: constructing highly-constrained sports timetables
From MaRDI portal
Publication:6106547
DOI10.1016/j.orl.2023.03.014zbMath1525.90224OpenAlexW4362640817MaRDI QIDQ6106547
David Van Bulck, Dries R. Goossens
Publication date: 3 July 2023
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2023.03.014
matheuristicsBenders' decompositionfirst-break-then-schedulesports timetablingfirst-schedule-then-breakinternational timetabling competition 2021 (ITC2021)
Cites Work
- Unnamed Item
- Unnamed Item
- The timetable constrained distance minimization problem
- A Benders approach for the constrained minimum break problem
- Solving mirrored traveling tournament problem benchmark instances with eight teams
- Tight bounds for break minimization in tournament scheduling
- Feasibility of home-away-pattern sets for round robin tournaments
- The problem of the moody chess players
- Partitioning procedures for solving mixed-variables programming problems
- The mathematics of playing golf, or: A new class of difficult nonlinear mixed integer programs
- Sports tournaments, home-away assignments, and the break minimization problem
- On the complexity of pattern feasibility problems in time-relaxed sports timetabling
- Scheduling in Sports
- A traditional Benders' approach to sports timetabling
- The international timetabling competition on sports timetabling (ITC2021)
- Integer programming models for round Robin tournaments
This page was built for publication: First-break-heuristically-schedule: constructing highly-constrained sports timetables