{"title":"带细胞分裂的组织P系统求解多维0-1背包问题","authors":"Juanjuan He, Z. Miao, Zheng Zhang, Xiaolong Shi","doi":"10.1109/BICTA.2009.5338106","DOIUrl":null,"url":null,"abstract":"Tissue P systems with cell division are biologically inspired theoretical models of distributed and parallel computing, which provide the possibility to solve computationally hard problems in polynomial time. In this paper, we present a semi-uniform solution to the multidimensional 0–1 knapsack problem by such kind of devices, which is linear in terms of the number of variables, the number of constraint inequalities, and all coefficients related with variables.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Solving multidimensional 0–1 knapsack problem by tissue P systems with cell division\",\"authors\":\"Juanjuan He, Z. Miao, Zheng Zhang, Xiaolong Shi\",\"doi\":\"10.1109/BICTA.2009.5338106\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Tissue P systems with cell division are biologically inspired theoretical models of distributed and parallel computing, which provide the possibility to solve computationally hard problems in polynomial time. In this paper, we present a semi-uniform solution to the multidimensional 0–1 knapsack problem by such kind of devices, which is linear in terms of the number of variables, the number of constraint inequalities, and all coefficients related with variables.\",\"PeriodicalId\":161787,\"journal\":{\"name\":\"2009 Fourth International on Conference on Bio-Inspired Computing\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Fourth International on Conference on Bio-Inspired Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BICTA.2009.5338106\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fourth International on Conference on Bio-Inspired Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BICTA.2009.5338106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Solving multidimensional 0–1 knapsack problem by tissue P systems with cell division
Tissue P systems with cell division are biologically inspired theoretical models of distributed and parallel computing, which provide the possibility to solve computationally hard problems in polynomial time. In this paper, we present a semi-uniform solution to the multidimensional 0–1 knapsack problem by such kind of devices, which is linear in terms of the number of variables, the number of constraint inequalities, and all coefficients related with variables.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
