arXiv (All)
open access
The Traveling Tournament Problem: An Overview
Over the past 25 years, the Traveling Tournament Problem (TTP) has become one of the most extensively studied optimization problems in sports scheduling. At its core, the TTP seeks to minimize the total travel distance incurred by teams that travel directly between opponents' venues during consecuti
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Strategic Effort and Non-Linear Positional Bandwagon Drafting Benefits in Multi-Stage Competitive Games: Evidence from Triathlon#1117225
- Age paradox: youth athletes in adult tournaments#169936
- How to optimise tournament draws: The case of the FIFA World Cup#158715
- Pre-game paired-comparison modeling of professional League of Legends map outcomes#985453
- Using the Soccer League Competition algorithm to solve the set covering problem [Utilizando el Algoritmo del Campeonato de Futbol para resolver el Problema del Conjunto de Cobertura]#948253
Record · ID 926516
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive