Solving the set covering problem with the soccer league competition algorithm

dc.contributor.authorJaramillo, A.es_ES
dc.contributor.authorCrawford, B.es_ES
dc.contributor.authorSoto, R.es_ES
dc.contributor.authorVillablanca, S.M.es_ES
dc.contributor.authorRubio, Á.G.es_ES
dc.contributor.authorSalas, J.es_ES
dc.contributor.authorOlguín, E.es_ES
dc.date.accessioned6/22/2022 13:33
dc.date.accessioned2022-09-30T16:31:44Z
dc.date.available6/22/2022 13:33
dc.date.available2022-09-30T16:31:44Z
dc.date.issued2016
dc.description.abstractThe Soccer League Competition (SLC) algorithm is a new metaheuristic approach intendended to solve complex optimization problems. It is based in the interaction model present in soccer teams and the goal to win every match, becoming the best team and league of players. This paper presents adaptations to the initial mode of SLC for the purpose of being applied to the Set Covering Problem (SCP) with a Python implementation. © Springer International Publishing Switzerland 2016.es_ES
dc.formatapplication/pdfes_ES
dc.identifier.doi10.1007/978-3-319-42007-3_75es_ES
dc.identifier.urihttps://doi.org/10.1007/978-3-319-42007-3_75
dc.language.isoenges_ES
dc.publisherSpringer Verlages_ES
dc.rightsinfo:eu-repo/semantics/closedAccesses_ES
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/es_ES
dc.sourceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)es_ES
dc.subjectComputer Sciencees_ES
dc.subjectMathematicses_ES
dc.subject.ocdehttp://purl.org/pe-repo/ocde/ford#1.02.01es_ES
dc.titleSolving the set covering problem with the soccer league competition algorithmes_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.type.versioninfo:eu-repo/semantics/publishedVersiones_ES
Archivos
Bloque original
Mostrando 1 - 1 de 1
Cargando...
Miniatura
Nombre:
174. Solving the set covering problem with the soccer league competition algorithm.pdf
Tamaño:
185.43 KB
Formato:
Adobe Portable Document Format