1. Research with MATF
  2. MATF
  3. Research outputs
Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/803
DC FieldValueLanguage
dc.contributor.authorMilanović, M.en_US
dc.contributor.authorMatić, D.en_US
dc.contributor.authorSavić, Aleksandaren_US
dc.contributor.authorKratica, J.en_US
dc.date.accessioned2022-08-15T15:47:45Z-
dc.date.available2022-08-15T15:47:45Z-
dc.date.issued2011-07-15-
dc.identifier.issn16833511en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/803-
dc.description.abstractTwo metaheuristic methods for solving the p-ary transitive reduction (TRP) problem are proposed: a genetic algorithm and a reduced variable neighborhood search method. Experiments were performed on a set of randomly generated instances. Presented results are the first experimental results in the literature so far for values p > 2.en
dc.relation.ispartofApplied and Computational Mathematicsen
dc.subjectEvolutionary Algorithmen
dc.subjectSignal Transduction Networksen
dc.subjectSystems Biologyen
dc.subjectTransitive Reductionen
dc.subjectVariable Neighborhood Searchen
dc.titleTwo metaheuristic approaches to solving the p-ary transitive reduction problemen_US
dc.typeArticleen_US
dc.identifier.scopus2-s2.0-79960162664-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/79960162664-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.firstpage294en
dc.relation.lastpage308en
dc.relation.volume10en
dc.relation.issue2en
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.orcid0009-0003-8568-4260-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

1
checked on Nov 15, 2024

Page view(s)

15
checked on Nov 15, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.