Fetching the paper…
Reading the bibliography…
Any sports competition needs a timetable, specifying when and where teams meet each other.
Knuth DE (1975) Estimating the efficiency of backtrack programs. Math Comput 29:122–136
1975
Earlier work this paper cites.
Rice JR (1976) The algorithm selection problem. Adv Comput 15:65–118
1976
Earlier work this paper cites.
de Werra D (1981) Scheduling in sports. In: Hansen P (ed) Studies on graphs and discrete programming, North-Holland, Amsterdam, pp 381–395
1981
Earlier work this paper cites.
Johnson DS, Aragon CR, McGeoch LA, Schevon C (1989) Optimization by simulated annealing: An experimental evaluation; part I, graph partitioning. Operations research 37:865–892
1989
Earlier work this paper cites.
Nemhauser GL, Trick MA (1998) Scheduling a major college basketball conference. Oper Res 46:1–8
1998
Earlier work this paper cites.
Easton K, Nemhauser G, Trick M (2001) The traveling tournament problem description and benchmarks. In: Walsh T (ed) Principles and Practice of Constraint Programming — CP 2001, Springer, Berlin, Heidelberg, pp 580–584
2001
Earlier work this paper cites.
Trick MA (2001) A schedule-then-break approach to sports timetabling. In: Burke E, Erben W (eds) Pract. Theory Autom. Timetabling III, Springer, Berlin, Heidelberg, pp 242–253
2001
Earlier work this paper cites.
Anagnostopoulos A, Michel L, Van Hentenryck P, Vergados Y (2006) A simulated annealing approach to the traveling tournament problem. J Sched 9:177–193
2006
Earlier work this paper cites.
Gebser M, Kaufmann B, Neumann A, Schaub T (2007) clasp : A conflict-driven answer set solver. In: Baral C, Brewka G, Schlipf JS (eds) Logic Programming and Nonmonotonic Reasoning, 9th International Conference, LPNMR 2007, Tempe, AZ, USA, May 15-17, 2007, Proceedings, Springer, Lecture Notes in Computer Science, vol 4483, pp 260–265
2007
Earlier work this paper cites.
Briskorn D (2008) Feasibility of home-away-pattern sets for round robin tournaments. Oper Res Lett 36:283 – 284
2008
Earlier work this paper cites.
Goossens D, Spieksma F (2009) Scheduling the Belgian soccer league. Interfaces 39:109–118
2009
Earlier work this paper cites.
Leyton-Brown K, Nudelman E, Shoham Y (2009) Empirical hardness models: Methodology and a case study on combinatorial auctions. Journal of the ACM (JACM) 56(4):1–52
2009
Earlier work this paper cites.
Lopes L, Smith-Miles K (2010) Pitfalls in instance generation for udine timetabling. In: International Conference on Learning and Intelligent Optimization, Springer, pp 299–302
2010
Earlier work this paper cites.
Smith-Miles K, Lopes L (2011) Generalising algorithm performance in instance space: A timetabling case study. In: Coello CAC (ed) Learning and Intelligent Optimization, Springer Berlin Heidelberg, Berlin, Heidelberg, pp 524–538
2011
Earlier work this paper cites.
Ribeiro CC, Urrutia S (2012) Scheduling the Brazilian soccer tournament: Solution approach and practice. INFORMS Journal on Applied Analytics 42:260–272
2012
Earlier work this paper cites.
Smith-Miles K, Lopes L (2012) Measuring instance difficulty for combinatorial optimization problems. Comput Oper Res 39:875 – 889
2012
Earlier work this paper cites.
Smith-Miles K, Tan TT (2012) Measuring algorithm footprints in instance space. In: 2012 IEEE Congress on Evolutionary Computation, pp 1–8
2012
Earlier work this paper cites.
Lopes L, Smith-Miles K (2013) Generating applicable synthetic instances for branch problems. Oper Res 61:563–577
2013
Cited alongside, same era.
Recalde D, Torres R, Vaca P (2013) Scheduling the professional Ecuadorian football league by integer programming. Comput Oper Res 40:2478 – 2484
2013
Cited alongside, same era.
Hutter F, Xu L, Holger HH, Leyton-Brown K (2014) Algorithm runtime prediction: Methods & evaluation. Artif Intell 206:79 – 111
2014
Cited alongside, same era.
Westphal S (2014) Scheduling the German basketball league. Interfaces 44:498–508
2014
Cited alongside, same era.
Lindauer M, Hoos HH, Hutter F, Schaub T (2015) Autofolio: An automatically configured algorithm selector. J Artif Intell Res 53:745–778
2015
Cited alongside, same era.
Van Bulck D, Goossens D, Schönberger J, Guajardo M (2020) RobinX: A three-field classification and unified data format for round-robin sports timetabling. Eur J Oper Res 280:568 – 580
2020
Later among the works it cites.
Berthold T, Koch T, Shinano Y (2021) MILP. Try. Repeat. In: De Causmaecker P, Özcan E, Vanden Berghe G (eds) Proc. 13th Int. Conf. Pract. Theory Autom. Timetabling, PATAT, vol 2, pp 403–411
2021
Later among the works it cites.
Durán G, Gutiérrez F, Guajardo M, Marenco J, Sauré D, Zamorano G (2021) Scheduling the main professional football league of Argentina. INFORMS Journal on Applied Analytics 51:361–372
2021
Later among the works it cites.
Kletzander L, Musliu N, Smith-Miles K (2021) Instance space analysis for a personnel scheduling problem. Annals of Mathematics and Artificial Intelligence 89:617–637
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Smith-Miles K, Bowly S (2015) Generating new test instances by evolving in instance space. Comput Oper Res 63:102–113
2015
Cited alongside, same era.
Fréchette A, Kotthoff L, Michalak T, Rahwan T, Hoos HH, Leyton-Brown K (2016) Using the shapley value to analyze algorithm portfolios. In: Proc. of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI Press, AAAI’16, pp 3397–3403
2016
Cited alongside, same era.
Januario T, Urrutia S (2016) A new neighborhood structure for round robin scheduling problems. Computers & Operations Research 70:127–139
2016
Cited alongside, same era.
Kotthoff L (2016) Algorithm Selection for Combinatorial Search Problems: A Survey, Springer International Publishing, Cham, pp 149–190
2016
Cited alongside, same era.
Elffers J, Nordström J (2018) Divide and conquer: Towards faster pseudo-boolean solving. In: Lang J (ed) Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, Stockholm, Sweden, ijcai.org, pp 1291–1299
2018
Cited alongside, same era.
Muñoz MA, Villanova L, Baatar D, Smith-Miles K (2018) Instance spaces for machine learning classification. Mach Learn 107:109–147
2018
Cited alongside, same era.
Sutton RS, Barto AG (2018) Reinforcement learning: An introduction. MIT press
2018
Cited alongside, same era.
Lamas-Fernandez C, Martinez-Sykora A, Potts CN (2021) Scheduling double round-robin sports tournaments. In: De Causmaecker P, Özcan E, Vanden Berghe G (eds) Proc. 13th Int. Conf. Pract. Theory Autom. Timetabling, PATAT, vol 2, pp 435 – 448
2021
Later among the works it cites.
Le Berre D, Wallon R (2021) On dedicated CDCL strategies for PB solvers. In: Li C, Manyà F (eds) Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings, Springer, Lecture Notes in Computer Science, vol 12831, pp 315–331
2021
Later among the works it cites.
Phillips AE, O’Sullivan M, Walker C (2021) An adaptive large neighbourhood search matheuristic for the ITC2021 sports timetabling competition. In: De Causmaecker P, Özcan E, Vanden Berghe G (eds) Proc. 13th Int. Conf. Pract. Theory Autom. Timetabling, PATAT, vol 2, pp 426 – 430
2021
Later among the works it cites.
De Coster A, Musliu N, Schaerf A, Schoisswohl J, Smith-Miles K (2022) Algorithm selection and instance space analysis for curriculum-based course timetabling. J Sched 25
2022
Later among the works it cites.
Dimitsas A, Gogos C, Valouxis C, Tzallas A, Alefragis P (2022) A pragmatic approach for solving the sports scheduling problem. In: Proc. 13th Int. Conf. Pract. Theory Autom. Timetabling, PATAT, vol 3, pp 195–207
2022
Later among the works it cites.
Fonseca GHG, Toffolo TAM (2022) A fix-and-optimize heuristic for the ITC2021 sports timetabling problem. J Sched 25:273–286
2022
Later among the works it cites.
Lester MM (2022) Pseudo-boolean optimisation for robinx sports timetabling. J Sched 25:287–299
2022
Later among the works it cites.
Rosati RM, Petris M, Di Gaspero L, Schaerf A (2022) Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021. J Sched 25:301–319
2022
Later among the works it cites.
Strassl S, Musliu N (2022) Instance space analysis and algorithm selection for the job shop scheduling problem. Computers & Operations Research 141:105661
2022
Later among the works it cites.
Ceschia S, Di Gaspero L, Schaerf A (2023) Educational timetabling: Problems, benchmarks, and state-of-the-art results. Eur J Oper Res 308:1–28
2023
Closest in time.
Smith-Miles K, Muñoz MA (2023) Instance space analysis for algorithm testing: Methodology and software tools. ACM Comput Surv 55
2023
Closest in time.
Van Bulck D, Goossens D (2023) First-break-heuristically-schedule: Constructing highly-constrained sports timetables. Operations Research Letters 51:326–331
2023
Closest in time.
Van Bulck D, Goossens D (2023) The international timetabling competition on sports timetabling (ITC2021). Eur J Oper Res 308:1249–1267
2023
Closest in time.