DC Field | Value | Language |
---|---|---|
dc.contributor.author | Milanović, Marija | en |
dc.contributor.author | Matić, Dragan | en |
dc.contributor.author | Savić, Aleksandar | en |
dc.contributor.author | Kratica, Jozef | en |
dc.date.accessioned | 2020-04-26T19:14:54Z | - |
dc.date.available | 2020-04-26T19:14:54Z | - |
dc.date.issued | 2011-07-15 | en |
dc.identifier.issn | 1683-3511 | en |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/494 | - |
dc.description.abstract | Two 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.publisher | Institute of Applied Mathematics of Baku State University | - |
dc.relation.ispartof | Applied and Computational Mathematics | en |
dc.subject | Evolutionary Algorithm | Signal Transduction Networks | Systems Biology | Transitive Reduction | Variable Neighborhood Search | en |
dc.title | Two metaheuristic approaches to solving the p-ary transitive reduction problem | en |
dc.type | Article | en |
dc.identifier.scopus | 2-s2.0-79960162664 | en |
dc.contributor.affiliation | Mathematical Institute of the Serbian Academy of Sciences and Arts | - |
dc.relation.firstpage | 294 | en |
dc.relation.lastpage | 308 | en |
dc.relation.issue | 2 | en |
dc.relation.volume | 10 | en |
dc.description.rank | M23 | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.openairetype | Article | - |
item.cerifentitytype | Publications | - |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
crisitem.author.orcid | 0000-0002-9752-0971 | - |
SCOPUSTM
Citations
1
checked on Nov 24, 2024
Page view(s)
18
checked on Nov 23, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.