{"title":"多维背包问题及其在认知无线电网络中的应用","authors":"Yang Song, Chi Zhang, Yuguang Fang","doi":"10.1109/MILCOM.2008.4753629","DOIUrl":null,"url":null,"abstract":"In this paper, a new variant of the standard knapsack problem is investigated and applied in cognitive radio networks. More specifically, the centralized spectrum allocation in cognitive radio networks is formulated as a multiple multidimensional knapsack problem. We propose an exact solution and a heuristic algorithm with guaranteed performance. The performance of the proposed algorithms are compared numerically.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"62","resultStr":"{\"title\":\"Multiple multidimensional knapsack problem and its applications in cognitive radio networks\",\"authors\":\"Yang Song, Chi Zhang, Yuguang Fang\",\"doi\":\"10.1109/MILCOM.2008.4753629\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a new variant of the standard knapsack problem is investigated and applied in cognitive radio networks. More specifically, the centralized spectrum allocation in cognitive radio networks is formulated as a multiple multidimensional knapsack problem. We propose an exact solution and a heuristic algorithm with guaranteed performance. The performance of the proposed algorithms are compared numerically.\",\"PeriodicalId\":434891,\"journal\":{\"name\":\"MILCOM 2008 - 2008 IEEE Military Communications Conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"62\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MILCOM 2008 - 2008 IEEE Military Communications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MILCOM.2008.4753629\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MILCOM 2008 - 2008 IEEE Military Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.2008.4753629","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multiple multidimensional knapsack problem and its applications in cognitive radio networks
In this paper, a new variant of the standard knapsack problem is investigated and applied in cognitive radio networks. More specifically, the centralized spectrum allocation in cognitive radio networks is formulated as a multiple multidimensional knapsack problem. We propose an exact solution and a heuristic algorithm with guaranteed performance. The performance of the proposed algorithms are compared numerically.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
