Recent harmony search algorithms for 0–1 optimization problems

Vista sencilla de ítem
dc.contributor.authorCrawford, B.es_ES
dc.contributor.authorSoto, R.es_ES
dc.contributor.authorGuzmán N.es_ES
dc.contributor.authorJohnson, F.es_ES
dc.contributor.authorParedes, F.es_ES
dc.date.accessioned6/22/2022 13:33
dc.date.accessioned2022-09-30T16:09:26Z
dc.date.available6/22/2022 13:33
dc.date.available2022-09-30T16:09:26Z
dc.date.issued2015
dc.description.abstractThe Set Covering Problem (SCP) has long been concentrating the interest of many researchers in the field of Combinatorial Optimization. SCP is a 0–1 integer programming problem that consists in finding a set of solutions which allow to cover a set of needs at the lowest cost possible. There are many applications of these kind of problems, the main ones are: location of services, files selection in a data bank, simplification of boolean expressions, balancing production lines, among others. Different metaheuristics have been proposed to solve it. Here, we present the possibilities to solve Set Covering Problems with Harmony Search. © Springer International Publishing Switzerland 2015.es_ES
dc.formatapplication/pdfes_ES
dc.identifier.doi10.1007/978-3-319-21380-4_96es_ES
dc.identifier.urihttps://doi.org/10.1007/978-3-319-21380-4_96
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.sourceCommunications in Computer and Information Sciencees_ES
dc.subjectComputer Sciencees_ES
dc.subject.ocdehttp://purl.org/pe-repo/ocde/ford#1.02.01es_ES
dc.titleRecent harmony search algorithms for 0–1 optimization problemses_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.type.versioninfo:eu-repo/semantics/publishedVersiones_ES
Archivos
Bloque original
Mostrando 1 - 1 de 1
Miniatura
Nombre:
78. Recent harmony search algorithms for 0–1 optimization problems.pdf
Tamaño:
693.56 KB
Formato:
Adobe Portable Document Format
Descargar
Colecciones
Ponencia de congreso