A beam search approach to the traveling tournament problem

DOI10.1007/978-3-030-43680-3_5zbMath1486.90164OpenAlexW3016075270MaRDI QIDQ2057120

Günther R. Raidl, Nikolaus Frohner, Bernhard Neumann

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-43680-3_5

zbMATH Keywords

beam searchtraveling tournament problemdecision diagrams

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

A traditional Benders' approach to sports timetabling

Uses Software

• irace

Cites Work

• Unnamed Item
• Decision diagrams for optimization
• Complexity of the traveling tournament problem
• 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
• DFS* and the Traveling Tournament Problem

This page was built for publication: A beam search approach to the traveling tournament problem