Please use this identifier to cite or link to this item:
|Title:||Modelos de programação inteira para o problema do torneio com viagens com estádios fixos|
|Other Titles:||Modelos de programação inteira para o problema do torneio com viagens com estádios fixos|
|Keywords:||Escalonamento em esportes; Programação inteira; Torneios; Otimização matemática; Otimização combinatória; Sports scheduling, Integer programming, Tournaments; Mathematical optimization, combinatorial optimization|
|Abstract:||Sports scheduling is a very attractive application area due to the importance of the problems in practice and to their interesting mathematical structure. We introduce a new problem, consisting in scheduling a compact single round-robin tournament with fixed venue assignments for each game. Three integer programming formulations are proposed and compared. We also propose two simple strategies to generate feasible solutions for larger instances in a reasonable amount of time. Comparative numerical results are presented.|
|Appears in Collections:||TEDE sem arquivo|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.