{"title":"关于投资项目选择的复杂性问题","authors":"S. Malakh","doi":"10.1109/SIBIRCON.2017.8109850","DOIUrl":null,"url":null,"abstract":"Consider the two-criterion problem of maximizing benefits and minimizing risks by selecting projects. Characteristics of projects, their interference and capital are known. We have proved strongly NP-hardness in case of Boolean problem. Pseudopolynomial solvable cases were proposed.","PeriodicalId":135870,"journal":{"name":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"About complexity of selection problem investment projects\",\"authors\":\"S. Malakh\",\"doi\":\"10.1109/SIBIRCON.2017.8109850\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Consider the two-criterion problem of maximizing benefits and minimizing risks by selecting projects. Characteristics of projects, their interference and capital are known. We have proved strongly NP-hardness in case of Boolean problem. Pseudopolynomial solvable cases were proposed.\",\"PeriodicalId\":135870,\"journal\":{\"name\":\"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIBIRCON.2017.8109850\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIBIRCON.2017.8109850","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
About complexity of selection problem investment projects
Consider the two-criterion problem of maximizing benefits and minimizing risks by selecting projects. Characteristics of projects, their interference and capital are known. We have proved strongly NP-hardness in case of Boolean problem. Pseudopolynomial solvable cases were proposed.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
