Show simple item record

dc.contributor.authorCrawford, B.
dc.contributor.authorSoto, R.
dc.contributor.authorLegue, I.F.
dc.contributor.authorOlguin, E.
dc.date.accessioned2025-10-31T18:32:23Z
dc.date.available2025-10-31T18:32:23Z
dc.date.issued2016
dc.identifier.urihttps://hdl.handle.net/20.500.12805/4622
dc.description.abstractThe Set Covering Problem (SCP) is a classic problem of combinatorial analytic. This problem consists in to find solutions what cover the needs to lower cost. Those can be services to cities, load balancing in production lines or databanks selections. In this paper, we study the resolution of SCP, through Invasive Weed Optimization (IWO), in its binary version; Binary Invasive Weed Optimization (BIWO). IWO, it is to imitate to Invasive Weed behavior (reproduction and selection natural), through mathematics formulations. Where the best weed has more chance of reproduction.en_US
dc.formatapplication/pdf
dc.language.isospa
dc.publisherIEEE Computer Society
dc.relation.ispartofurn:issn:2166-0735
dc.rightshttps://purl.org/coar/access_right/c_abf2
dc.rights.urihttps://creativecommons.org/licenses/by-nc-sa/4.0/
dc.subjectSDG 15en_US
dc.subjectOptimized Logistics and Vehicle Routing Solutionsen_US
dc.subjectInnovative Algorithms for Set Covering Optimizationen_US
dc.titleAlgoritmo Discreto de Optimización Hiebras Invasivas para el Set Covering Problemes_PE
dc.title.alternativeA discrete invasive weed optimization algorithm for the set covering problemen_US
dc.typehttps://purl.org/coar/resource_type/c_5794
dc.identifier.doihttps://doi.org/10.1109/CISTI.2016.7521489
dc.subject.ocdehttps://purl.org/pe-repo/ocde/ford#1.02.01
dc.type.otherConference Paper
dc.identifier.journalIberian Conference on Information Systems and Technologies, CISTI
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