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...
Guardado en:
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
-
An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in Rn
por: CláudioP. Santiago, et al.
Publicado: (2019) -
Hyper-parameter optimization for support vector machines using stochastic gradient descent and dual coordinate descent
por: W.e.i. Jiang, et al.
Publicado: (2020) -
Real-time algorithms for the bilevel double-deck elevator dispatching problem
por: Janne Sorsa
Publicado: (2019) -
A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights
por: Anjulika Gupta, et al.
Publicado: (2018) -
New exact solution approaches for the split delivery vehicle routing problem
por: Gizem Ozbaygin, et al.
Publicado: (2018)