Mostrar el registro sencillo del ítem

A beam-search approach to the set covering problem

dc.contributor.authorReyes V.
dc.contributor.authorAraya I.
dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorOlguín E.
dc.date.accessioned2020-09-02T22:26:58Z
dc.date.available2020-09-02T22:26:58Z
dc.date.issued2016
dc.identifier10.1007/978-3-319-33625-1_35
dc.identifier.citation464, , 395-402
dc.identifier.issn21945357
dc.identifier.urihttps://hdl.handle.net/20.500.12728/6007
dc.descriptionIn 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.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceSilhavy R.Senkerik R.Oplatkova Z.K.Silhavy P.Prokopova Z.
dc.subjectBeam search
dc.subjectBranch-and-Bound
dc.subjectGreedy
dc.subjectSCP
dc.subjectBenchmarking
dc.subjectBranch and bound method
dc.subjectIntelligent systems
dc.subjectStochastic systems
dc.subjectBeam search
dc.subjectBreadth-first search
dc.subjectFixed numbers
dc.subjectGreedy
dc.subjectMinimal cost
dc.subjectSearch trees
dc.subjectSet covering problem
dc.subjectArtificial intelligence
dc.titleA beam-search approach to the set covering problem
dc.typeConference Paper


Ficheros en el ítem

Thumbnail
Nombre:
item_2-s2.0-84964699789.pdf
Tamaño:
2.308Kb
Formato:
PDF
Ver/

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem