Optimal knockout tournaments: definition and computation

DOI10.1007/978-3-030-97549-4_25zbMath1490.90299OpenAlexW4225630761MaRDI QIDQ2128447

Liviu Ion Ciora, Amelia Bădică, Doina Logofătu, Costin Bădică, Ion Buligiu

Publication date: 22 April 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-97549-4_25

zbMATH Keywords

optimizationdynamic programmingalgorithm complexityknockout tournament

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Dynamic programming (90C39)

Cites Work

• The early history of the factorial function
• On most effective tournament plans with fewer games than competitors
• Probabilistic Completion of a Knockout Tournament

This page was built for publication: Optimal knockout tournaments: definition and computation