发布求助
文献互助 智能选刊 最新文献

关于投资项目选择的复杂性问题

2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON) Pub Date : 2017-09-01 DOI:10.1109/SIBIRCON.2017.8109850
S. Malakh
{"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}
引用次数: 0

摘要

考虑选择项目时收益最大化和风险最小化的两个标准问题。项目的特点，他们的干扰和资本是已知的。我们证明了布尔问题的强np -硬度。提出了伪多项式可解的情况。
本文章由计算机程序翻译，如有差异，请以英文原文为准。
分享
查看原文 本刊更多论文
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.
求助全文
通过发布文献求助，成功后即可免费获取论文全文。 去求助
来源期刊
2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)
2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信