cris.boxmetadata.label.title
Solving the set covering problem with the soccer league competition algorithm
cris.boxmetadata.label.dateissued
01 browse.startsWith.months.january 2016
cris.boxmetadata.label.accesslevel
metadata only access
cris.boxmetadata.label.resourcetype
conference paper
cris.boxmetadata.label.authors
cris.boxmetadata.label.publisher
Springer Verlag
cris.boxmetadata.label.abstract
The 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.
cris.boxmetadata.label.citationstartpage
884
cris.boxmetadata.label.citationendpage
891
cris.boxmetadata.label.volume
9799
cris.boxmetadata.label.language
English
cris.boxmetadata.label.ocdeknowledgeArea
Bioinformática
cris.boxmetadata.label.subjects
cris.boxmetadata.label.doi
cris.boxmetadata.label.scopusidentifier
2-s2.0-84978890830
cris.boxmetadata.label.containerissn
03029743
cris.boxmetadata.label.containerisbn
9783319420066
cris.boxmetadata.label.conference
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
peru-layout.shadow-copies
Directorio de Producción Científica
Scopus