{"title":"Max-Min Ant System for the sum coloring problem","authors":"Douiri Sidi Mohamed, S. Elbernoussi","doi":"10.1109/CCCA.2011.6031417","DOIUrl":null,"url":null,"abstract":"The sum coloring problem (MSCP) is an NP-hard problem derived from the graphs coloring (GCP). The problem (MSCP) consists in minimizing the sum of colors in a graph. Our resolution approach is based on an hybridization of Max-Min Ant System (MMAS) an extension of Ant System and a local heuristic based on an improvement of the maximal independent set algorithm given by F. Glover[4].","PeriodicalId":259067,"journal":{"name":"2011 International Conference on Communications, Computing and Control Applications (CCCA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Communications, Computing and Control Applications (CCCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCCA.2011.6031417","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
The sum coloring problem (MSCP) is an NP-hard problem derived from the graphs coloring (GCP). The problem (MSCP) consists in minimizing the sum of colors in a graph. Our resolution approach is based on an hybridization of Max-Min Ant System (MMAS) an extension of Ant System and a local heuristic based on an improvement of the maximal independent set algorithm given by F. Glover[4].
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
