An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment

dc.citation.titleJournal of Combinatorial Optimizationes
dc.citation.volume36es
dc.creatorRecalde, Diego
dc.creatorSeverín, Daniel Esteban
dc.creatorTorres, Ramiro
dc.creatorVaca, Polo
dc.date.accessioned2020-09-18T19:28:19Z
dc.date.available2020-09-18T19:28:19Z
dc.date.issued2018-02-09
dc.descriptionIn this work a balanced k-way partitioning problem with weight constraints is defined to model the sports team realignment. Sports teams must be partitioned into a fixed number of groups according to some regulations, where the total distance of the road trips that all teams must travel to play a double round robin tournament in each group is minimized. Two integer programming formulations for this problem are introduced, and the validity of three families of inequalities associated to the polytope of these formulations is proved. The performance of a tabu search procedure and a branch and cut algorithm, which uses the valid inequalities as cuts, is evaluated over simulated and real-world instances. In particular, an optimal solution for the realignment of the Ecuadorian football league is reported and the methodology can be suitable adapted for the realignment of other sports leagues.es
dc.description.filFil: Recalde, Diego. Escuela Politécnica Nacional. Departamento de Matemática. Quito; Ecuadores
dc.description.filFil: Severín, Daniel. Universidad Nacional de Rosario. FCEIA. CONICET. Rosario; Argentinaes
dc.description.filFil: Torres, Ramiro. Escuela Politécnica Nacional. Departamento de Matemática. Quito; Ecuadores
dc.description.filFil: Vaca, Polo. Escuela Politécnica Nacional. Departamento de Matemática. Quito; Ecuadores
dc.description.sponsorship15-MathAmSud-06 “PACK-COVER: Packing and covering, structural aspects” trilateral cooperation project.es
dc.formatapplication/pdf
dc.format.extent1-21es
dc.identifier.issn1573-2886es
dc.identifier.urihttp://hdl.handle.net/2133/18961
dc.language.isoenges
dc.publisherSpringer Nature Switzerlandes
dc.relationhttp://hdl.handle.net/2133/18946
dc.relationinfo:eu-repo/semantics/dataset/hdl/2133/18946
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/7yypjxy4f7.1
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/10.1007/s10878-018-0254-1
dc.relation.publisherversionhttps://doi.org/10.1007/s10878-018-0254-1es
dc.rightsopenAccesses
dc.rights.holder© 2020 Springer Nature Switzerland AG. Part of Springer Nature.es
dc.subjectInteger programming modelses
dc.subjectGraph partitioninges
dc.subjectTabu searches
dc.subjectSports team realignmenes
dc.subjecthttp://biblio-int.mincyt.gob.ar/ford/2.2es
dc.titleAn exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignmentes
dc.typearticle
dc.typeartículo
dc.typeacceptedVersion
dc.type.collectionarticulo
dc.type.versionacceptedVersiones

Archivos

Bloque original
Mostrando 1 - 1 de 1
Cargando...
Miniatura
Nombre:
An_Exact_Approach_for_the_Balanced_k-Way_Partition.pdf
Tamaño:
382.17 KB
Formato:
Adobe Portable Document Format
Descripción:
Bloque de licencias
Mostrando 1 - 1 de 1
Nombre:
license.txt
Tamaño:
3.59 KB
Formato:
Item-specific license agreed upon to submission
Descripción: