A beam-search approach to the set covering problem

dc.contributor.authorReyes, V.es_ES
dc.contributor.authorAraya, I.es_ES
dc.contributor.authorCrawford, B.es_ES
dc.contributor.authorSoto, R.es_ES
dc.contributor.authorOlguín, E.es_ES
dc.date.accessioned6/22/2022 14:20
dc.date.available6/22/2022 14:20
dc.date.issued2016
dc.description.abstractIn this work we present a beam-search approach applied to the Set Covering Problem. The goal of this problem is to choose a subset of columns of minimal cost covering every row. Beam Search constructs a search tree by using a breadthfirst search strategy, however only a fixed number of nodes are kept and the rest are discarded. Even though original beam search has a deterministic nature, our proposal has some elements that makes it stochastic. This approach has been tested with a well-known set of 45 SCP benchmark instances from OR-Library showing promising results. © Springer International Publishing Switzerland 2016.es_ES
dc.formatapplication/pdfes_ES
dc.identifier.doi10.1007/978-3-319-33625-1_35es_ES
dc.identifier.urihttps://doi.org/10.1007/978-3-319-33625-1_35
dc.language.isoen_USes_ES
dc.publisherSpringer Verlages_ES
dc.publisher.countryDEes_ES
dc.relation.ispartofAdvances in Intelligent Systems and Computinges_ES
dc.rightsinfo:eu-repo/semantics/closedAccesses_ES
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/es_ES
dc.sourceAdvances in Intelligent Systems and Computinges_ES
dc.subjectComputer Sciencees_ES
dc.subjectEngineeringes_ES
dc.subject.ocdehttp://purl.org/pe-repo/ocde/ford#2.02.04es_ES
dc.titleA beam-search approach to the set covering problemes_ES
dc.typeinfo:eu-repo/semantics/conferenceObjectes_ES
dc.type.versioninfo:eu-repo/semantics/publishedVersiones_ES
Archivos
Bloque original
Mostrando 1 - 1 de 1
Cargando...
Miniatura
Nombre:
item_2-s2.0-84964699789.pdf
Tamaño:
2.31 KB
Formato:
Adobe Portable Document Format
Descripción:
Bloque de licencias
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
license.txt
Tamaño:
1.71 KB
Formato:
Item-specific license agreed upon to submission
Descripción: