Show simple item record

dc.contributor.authorZissimopoulos, Vassilis
dc.contributor.authorPaschos, Vangelis
dc.contributor.authorHifi, Mhand
dc.date.accessioned2010-03-15T13:38:55Z
dc.date.available2010-03-15T13:38:55Z
dc.date.issued2000
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/3689
dc.language.isoenen
dc.subjectSet coveringen
dc.subject.ddc003en
dc.titleA neural network for the minimum set covering problemen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenWe solve approximately the weighted set covering problem by putting together a neural network model, the Boltzmann machine (BM), and some combinatorial ideas. We compare the solutions provided by the network with the ones obtained using the greedy set covering heuristic and the Lagrangian heuristic developed by Beasley. Moreover, we use a simple and intuitive polynomial decomposition schema treating large instances by decomposing them into smaller ones. Finally, we report on the relation between the convergence time of the model and the size of the instances of set covering.en
dc.relation.isversionofjnlnameChaos, Solitons and Fractals
dc.relation.isversionofjnlvol11en
dc.relation.isversionofjnlissue13en
dc.relation.isversionofjnldate2000-10
dc.relation.isversionofjnlpages2079-2089en
dc.relation.isversionofdoihttp://dx.doi.org/10.1016/S0960-0779(99)00104-6en
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelRecherche opérationnelleen


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