A complete search method for the relaxed traveling tournament problem

The traveling tournament problem is a sports scheduling problem that includes two major issues in creating timetables: home/away pattern feasibility and travel distance. In this problem, the schedule must be compact: every team plays in every time slot. However, there are some sports leagues that ha...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Filipe Brandão, JoãoPedro Pedroso
Formato: article
Lenguaje:EN
Publicado: Elsevier 2014
Materias:
Acceso en línea:https://doaj.org/article/95c7bebf44ba460ba6c53c0e2963f990
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares