Show simple item record

dc.contributor.authorCrawford, B.
dc.contributor.authorSoto, R.
dc.contributor.authorGuzmán, N.
dc.contributor.authorJohnson, F.
dc.contributor.authorParedes, F.
dc.date.accessioned2025-10-31T18:32:22Z
dc.date.available2025-10-31T18:32:22Z
dc.date.issued2015
dc.identifier.urihttps://hdl.handle.net/20.500.12805/4613
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.en_US
dc.description.sponsorshipBroderick Crawford is supported by Grant CONICYT / FONDECYT / REGULAR / 1140897. Ricardo Soto is supported by Grant CONICYT / FONDECYT / INICIACION / 11130459.
dc.formatapplication/pdf
dc.language.isoeng
dc.publisherSpringer Verlag
dc.relation.ispartofurn:issn:1865-0929
dc.rightshttps://purl.org/coar/access_right/c_abf2
dc.rights.urihttps://creativecommons.org/licenses/by-nc-sa/4.0/
dc.subjectOptimized Logistics and Vehicle Routing Solutionsen_US
dc.subjectInnovative Algorithms for Set Covering Optimizationen_US
dc.titleRecent harmony search algorithms for 0–1 optimization problemsen_US
dc.typehttps://purl.org/coar/resource_type/c_5794
dc.identifier.doihttps://doi.org/10.1007/978-3-319-21380-4_96
dc.subject.ocdehttps://purl.org/pe-repo/ocde/ford#1.02.01
dc.type.otherConference Paper
dc.identifier.journalCommunications in Computer and Information Science
dc.type.versionhttps://purl.org/coar/version/c_970fb48d4fbd8a85


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

https://purl.org/coar/access_right/c_abf2
Except where otherwise noted, this item's license is described as https://purl.org/coar/access_right/c_abf2