A traditional Benders' approach to sports timetabling
From MaRDI portal
Publication:6109825
DOI10.1016/j.ejor.2022.10.044OpenAlexW4308456248MaRDI QIDQ6109825
Dries R. Goossens, David Van Bulck
Publication date: 4 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.10.044
OR in sportsBenders' decompositiontravelling tournament problemfirst-break-then-schedulefirst-day-off-then-schedule
Related Items
Cites Work
- Unnamed Item
- A Benders approach for the constrained minimum break problem
- Feasibility of home-away-pattern sets for round robin tournaments
- A Benders approach for computing lower bounds for the mirrored traveling tournament problem
- Scheduling partial round robin tournaments subject to home away pattern sets
- Cut generation for an integrated employee timetabling and production scheduling problem
- Partitioning procedures for solving mixed-variables programming problems
- Logic-based Benders decomposition
- Benders decomposition for curriculum-based course timetabling
- Minimization of rest mismatches in round robin tournaments
- Scheduling Argentina's professional basketball leagues: a variation on the travelling tournament problem
- The Benders decomposition algorithm: a literature review
- A Lagrangian approach for minimum cost single round robin tournaments
- Scheduling asynchronous round-robin tournaments
- A beam search approach to the traveling tournament problem
- Optimizing rest times and differences in games played: an iterative two-phase approach
- Determining matchdays in sports league schedules to minimize rest differences
- RobinX: a three-field classification and unified data format for round-robin sports timetabling
- Handling fairness issues in time-relaxed tournaments with availability constraints
- Scheduling a non-professional indoor football league: a tabu search based approach
- Scheduling a triple round robin tournament for the best Danish soccer league
- Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
- A variable neighborhood search method for solving the traveling tournaments problem
- On the complexity of pattern feasibility problems in time-relaxed sports timetabling
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Scheduling in Sports
- Odd Minimum Cut-Sets and b-Matchings
- An Evolutionary Tabu Search Algorithm And The NHL Scheduling Problem
- Maximum matching and a polyhedron with 0,1-vertices
- Round-robin scheduling with regard to rest differences
