Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorToffolo, Túlio Ângelo Machado-
dc.contributor.authorChristiaens, Jan-
dc.contributor.authorSpieksma, Frits C. R.-
dc.contributor.authorBerghe, Greet Vanden-
dc.identifier.citationTOFFOLO, T. A. M. et al. The sport teams grouping problem. Annals of Operations Research, p. 1-21, 2017. Disponível em: <>. Acesso em: 16 jun. 2018.pt_BR
dc.description.abstractThe sport teams grouping problem (STGP) concerns the assignment of sport teams to round-robin tournaments. The objective is to minimize the total travel distance of the participating teams while simultaneously respecting fairness constraints. The STGP is an NP-Hard combinatorial optimization problem highly relevant in practice. This paper investigates the performance of some complimentary optimization approaches to the STGP. Three integer programming formulations are presented and thoroughly analyzed: two compact formulations and another with an exponential number of variables, for which a branch-and-price algorithm is proposed. Additionally, a meta-heuristic method is applied to quickly generate feasible high-quality solutions for a set of real-world instances. By combining the different approaches’ results, solutions within 1.7% of the optimum values were produced for all feasible instances. Additionally, to support further research, the considered STGP instances and corresponding solutions files were shared online.pt_BR
dc.subjectInteger programmingpt_BR
dc.subjectColumn generationpt_BR
dc.subjectDecomposition strategiespt_BR
dc.titleThe sport teams grouping problem.pt_BR
dc.typeArtigo publicado em periodicopt_BR
Appears in Collections:DECOM - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
ARTIGO_SportTeamsGrouping.pdf830,22 kBAdobe PDFView/Open    Request a copy

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.