Which algorithm to select in sports timetabling?

DOI10.1016/J.EJOR.2024.06.005MaRDI QIDQ6982822zbMATH OpenFDO

Authors David Van Bulck, Dries R. Goossens, Jan-Patrick Clarner, Angelos Dimitsas, George H. G. Fonseca, Martin Mariusz Lester, Jaap Pedersen, Antony E. Phillips, Roberto Maria Rosati

Publication date 16 May 2025

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2024.06.005

zbMATH Keywords

algorithm selectioninstance space analysisITC2021OR in sportssports scheduling

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Cites work

• A new neighborhood structure for round robin scheduling problems
• A simulated annealing approach to the traveling tournament problem
• Algorithm runtime prediction: methods \& evaluation
• Algorithm selection for combinatorial search problems: a survey
• Educational timetabling: problems, benchmarks, and state-of-the-art results
• Empirical hardness models, methodology and a case study on combinatorial auctions
• Estimating the Efficiency of Backtrack Programs
• Feasibility of home-away-pattern sets for round robin tournaments
• First-break-heuristically-schedule: constructing highly-constrained sports timetables
• Generating applicable synthetic instances for branch problems
• Generating new test instances by evolving in instance space
• Generation techniques for linear programming instances with controllable properties
• scientific article; zbMATH DE number 1728542 (Why is no real title available?)
• scientific article; zbMATH DE number 2084735 (Why is no real title available?)
• Instance space analysis and algorithm selection for the job shop scheduling problem
• Instance space analysis for a personnel scheduling problem
• Instance spaces for machine learning classification
• Measuring instance difficulty for combinatorial optimization problems
• Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021
• On dedicated CDCL strategies for PB solvers
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Reinforcement learning. An introduction
• RobinX: a three-field classification and unified data format for round-robin sports timetabling
• Scheduling a non-professional indoor football league: a tabu search based approach
• Scheduling in Sports
• Scheduling the professional Ecuadorian football league by integer programming
• Ten years of feasibility pump, and counting
• The international timetabling competition on sports timetabling (ITC2021)

Cited in

(3)

• Hybridizing carousel greedy and kernel search: a new approach for the maximum flow problem with conflict constraints
• Beyond leagues: a single incomplete round Robin tournament for multi-league sports timetabling
• Obtaining k-degree anonymous networks via mathematical programming

This page was built for publication: Which algorithm to select in sports timetabling?

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