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/674
DC FieldValueLanguage
dc.contributor.authorDjurić, Brankicaen_US
dc.contributor.authorKratica, Jozefen_US
dc.contributor.authorTošić, Dušanen_US
dc.contributor.authorFilipović, Vladimiren_US
dc.date.accessioned2022-08-14T09:49:36Z-
dc.date.available2022-08-14T09:49:36Z-
dc.date.issued2008-01-01-
dc.identifier.issn13359150en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/674-
dc.description.abstractThis paper exposes a research of the NP-hard Maximally Balanced Connected Partition problem (MBCP). The proposed solution comprises of a genetic algorithm (GA) that uses: binary representation, fine-grained tournament selection, one-point crossover, simple mutation with frozen genes and caching technique. In cases of unconnected partitions, penalty functions are successfully applied in order to obtain the feasible individuals. The effectiveness of presented approach is demonstrated on the grid graph instances and on random instances with up to 300 vertices and 2000 edges.en_US
dc.language.isoenen_US
dc.publisherBratislava : Slovak Academy of Sciences, Institute of Informaticsen_US
dc.relation.ispartofComputing and Informaticsen_US
dc.subjectBalanced partitionsen_US
dc.subjectCombinatorial optimizationen_US
dc.subjectEvolutionary computationen_US
dc.subjectMetaheuristicsen_US
dc.titleSolving the maximally balanced connected partition problem in graphs by using genetic algorithmen_US
dc.typeArticleen_US
dc.identifier.scopus2-s2.0-47249137773-
dc.identifier.isi000257411500003-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/47249137773-
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.relation.issn1335-9150en_US
dc.description.rankM23en_US
dc.relation.firstpage341en_US
dc.relation.lastpage354en_US
dc.relation.volume27en_US
dc.relation.issue3en_US
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.languageiso639-1en-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.orcid0000-0002-5943-8037-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

20
checked on Feb 11, 2026

Page view(s)

11
checked on Jan 19, 2025

Google ScholarTM

Check


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