{"title":"经典背包到几何背包:一次旅行","authors":"P. Mahapatra","doi":"10.1109/ICECTECH.2011.5941660","DOIUrl":null,"url":null,"abstract":"Knapsack problems have been extensively studied in operations research for last few decades. We review the method of mapping classical knapsack problems into a new class of geometric knapsack problems. Then it is shown that a wide class of problems in geometric optimization and facility location can be represented as geometric knapsack problems.","PeriodicalId":184011,"journal":{"name":"2011 3rd International Conference on Electronics Computer Technology","volume":"4 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Classical knapsack to geometric knapsack: A journey\",\"authors\":\"P. Mahapatra\",\"doi\":\"10.1109/ICECTECH.2011.5941660\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Knapsack problems have been extensively studied in operations research for last few decades. We review the method of mapping classical knapsack problems into a new class of geometric knapsack problems. Then it is shown that a wide class of problems in geometric optimization and facility location can be represented as geometric knapsack problems.\",\"PeriodicalId\":184011,\"journal\":{\"name\":\"2011 3rd International Conference on Electronics Computer Technology\",\"volume\":\"4 3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 3rd International Conference on Electronics Computer Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECTECH.2011.5941660\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 3rd International Conference on Electronics Computer Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECTECH.2011.5941660","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Classical knapsack to geometric knapsack: A journey
Knapsack problems have been extensively studied in operations research for last few decades. We review the method of mapping classical knapsack problems into a new class of geometric knapsack problems. Then it is shown that a wide class of problems in geometric optimization and facility location can be represented as geometric knapsack problems.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
