Show simple item record

dc.contributor.authorYang, Shengxiangen
dc.date.accessioned2013-05-15T12:55:31Z
dc.date.available2013-05-15T12:55:31Z
dc.date.issued2011
dc.identifier.citationComsa, I., Grosan, C. and Yang, S. (2011) A brief analysis of evolutionary algorithms for the dynamic multiobjective subset sum problem. Studia Universitatis Babes-Bolyai, Series Informatica, LVI(2), June 2011, pp. 87-94.en
dc.identifier.issn1224-869x
dc.identifier.urihttp://hdl.handle.net/2086/8490
dc.description.abstractThe paper investigate the behavior of evolutionary algorithms for solving multiobjective combinatorial problems in dynamic environments. Present work envisages the multiobjective subset sum problem which is known as an NP-hard problem. Several test and analysis are performed in order to asses the advantages and to point out the disadvantages and drawbacks of these classes of algorithms.en
dc.language.isoenen
dc.publisherBabes-Bolyai University, Faculty of Mathematics and Computer Science.en
dc.subjectDiscret mathematicsen
dc.subjectGraph theoryen
dc.subjectGraphy algorithmsen
dc.subjectDynamic environmenten
dc.subjectMultiobjective optimizationen
dc.subjectNP-completenessen
dc.titleA brief analysis of evolutionary algorithms for the dynamic multiobjective subset sum problem.en
dc.typeArticleen
dc.researchgroupCentre for Computational Intelligenceen


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